Generalized nondeterministic finite automaton: Difference between revisions

Revision as of 14:21, 14 November 2022

Latest revision as of 06:30, 14 April 2025

(4 intermediate revisions by 3 users not shown)

Line 3:

==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''}) × (''S'' ∖<math>\setminus</math> {''s''}) → ''R'');

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

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

Line 21 ⟶ 20:

* 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 automatamachines]]