|
Related articles:
Regular language
Formal language
Regular expression
Turing machine
Key terms: q math accept automata delta finite automaton word symbol input sigma machine tape transition read dfa nfa metric string widehat alphabet timed stack monoid finite state rejected epsilon rangle teoria finite automata accept states topological recursive transition function set of states infinite langle q probability turing machines recognize formal language set of all possible rightarrow q quantum finite finite state machine finite automaton regular language nondeterministic finite set of accept states function composition Search external links cited by footnotes on Wikipedia page Automata theory: |
|