2012•TU/e Research PortalOpen access

Failure deterministic finite automata

Derrick G. Kourie, Bruce W. Watson, Loek Cleophas, Fritz Venter, J. Holub, J. Zdarek

Abstract

Abstract. Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for de-riving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the DFA. A small mod-ification to the classical DFA’s algorithm for recognising language elements yields a corresponding algorithm for an FDFA.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Deterministic finite automaton, Deterministic automaton, DFA minimization, Nondeterministic finite automaton, Two-way deterministic finite automaton, Regular language, Finite-state machine, Computer science