Content deleted Content added
→Automaton: indicate priority |
m The subsection ===Recognized language=== just below assumes the definition of NFA without epsilon-moves. The definition of NFA with epsilon-moves is in the section ==NFA with ε-moves==. |
||
Line 30:
* a finite [[Set (mathematics)|set]] of states <math>Q</math>,
* a finite set of [[input symbol]]s <math>\Sigma</math>,
* a transition function <math>\delta</math> : <math>Q\times
* an ''initial'' (or ''start'') state <math>q_0 \in Q</math>, and
* a set of states <math>F</math> distinguished as ''accepting'' (or ''final'') ''states'' <math>F \subseteq Q</math>.
| |||