Nondeterministic finite automaton: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Altered url. URLs might have been anonymized. Add: authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 587/933
Line 29:
<math>(Q, \Sigma, \delta, q_0, F)</math>, consisting of
* a finite [[Set (mathematics)|set]] of states <math>Q</math>.
* a finite set of [[input symbol]]s <math>\Sigma</math> where <math>\Sigma \cup \epsilon </math>.
* a transition function <math>\delta</math> : <math>Q\times\Sigma \rightarrow \mathcal{P}(Q)</math>.
* an ''initial'' (or ''start'') state <math>q_0 \in Q</math>.