Generalized nondeterministic finite automaton: Difference between revisions

Content deleted Content added

Revision as of 20:09, 14 July 2023 edit Beland (talk \| contribs) Autopatrolled, Administrators 259,086 edits convert special characters found by Wikipedia:Typo Team/moss (via WP:JWB) Tag: Reverted ← Previous edit		Latest revision as of 06:30, 14 April 2025 edit undo JJMC89 bot III (talk \| contribs) Bots, Administrators 4,312,397 edits m Moving Category:Finite automata to Category:Finite-state machines per Wikipedia:Categories for discussion/Speedy
(3 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 ~~automata~~machines]]