Generalized nondeterministic finite automaton: Difference between revisions

Revision as of 22:59, 6 May 2009

Latest revision as of 06:30, 14 April 2025

(30 intermediate revisions by 24 users not shown)

Line 1:

In the [[theory of computation]], a '''generalized nondeterministic finite stateautomaton''' machine('''GNFA'''), also known as an '''expression automaton''' or a '''generalized nondeterministic finite state machine''', is a variation of a

or '''generalized nondeterministic finite automaton (GNFA)''' is a [[nondeterministic finite state machine|NFAautomaton]] (NFA) where each transition may beis labeled with any [[regular expression]]. The GNFA reads blocks of symbols from the input which constitute a string as defined by the regular expression on the transition. There are several differences between a standard finite state machine and a generalized nondeterministic finite state machine. A GNFA must have only one start state and one accept state, and these cannot be the same state, whereas an NFA or DFA both may have several accept states, and the start state can be an accept state. A GNFA must have only one transition between any two states, whereas a NFA or DFA both allow for numerous transitions between states. In a GNFA, a state has a single transition to every state in the machine, although often it is a convention to ignore the transitions that are labelled with the empty set when drawing generalized nondeterministic finite state machines.

==Formal definition==

A GNFA can be defined as a [[n-tuple|5-tuple]], (''S'', Σ, ''T'', ''s'', ''a''), consisting of

* a [[finite set]] of states (''S'');

* a finite set called the alphabet (Σ);

* a transition [[function (mathematics)|function]] (''T'' : (''S'' -<math>\setminus</math> {''a''}) &times;× (''S'' -<math>\setminus</math> {''s''}) → ''R'');

* a start state (''s'' ∈ ''S'');

* an accept state (''a'' ∈ ''S'');

where ''R'' is the collection of all regular expressions over the alphabet Σ.

The transition function takes as its argument a pair of two states and outputs a regular expression (the label of the transition). This differs from other finite state machines, which take as input a single state and an input from the alphabet (or the empty string in the case of nondeterministic finite state machines) and outputs the next state (or the set of possible states in the case of nondeterministic finite state machines). A [[deterministic finite automaton|DFA]] or [[nondeterministic finite automaton|NFA]] can easily be converted into a GNFA and then the GNFA can be easily converted into a [[regular expression]] by repeatedly collapsing parts of it to single edges until ''S'' = {''s'', ''a''}. Similarly, GNFAs can be reduced to NFAs by changing regular expression operators into new edges until each edge is labelled with a regular expression matching a single string of length at most 1. NFAs, in turn, can be reduced to DFAs using the [[powerset construction]]. This shows that GNFAs recognize the same set of [[formal language]]s as DFAs and NFAs.

==References==

* Yo-Sub Han and [[Derick Wood]]. "The Generalization of Generalized Automata: Expression Automata." In: 9th International [[Conference on Implementation and Application of Automata]], CIAA 2004, Kingston, Canada, July 22–24, 2004, Revised Selected Papers, [[LNCS]] 3317, pp.&nbsp;156–166. {{doi|10.1007/b105090}}

* [[Michael Sipser]]. 2006. Introduction to the Theory of Computation (2nd ed.). International Thomson Publishing.

[[Conference on Implementation and Application of Automata]], IAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers,

[[LNCS]] 3317, pp. 156-166. doi:10.1007/b105090

==External links==

* A graphical description of GNFAs and the process of converting an NFA to a regular expression using GNFAs, can be found at [http://www.cs.sunysb.edu/~cse350/slides/rgExp2.pdf]

[[Category:Finite-state machines]]

[[Category:Automata]]

[[hr:Poopćeni nedeterministički konačni automat]]

[[ja:非決定性有限オートマトン]]