Automata Theory: WIKI

https://en.wikipedia.org/wiki/Automata_theory https://en.wikipedia.org/wiki/Finite-state_machine https://en.wikipedia.org/wiki/Model_of_computation https://en.wikipedia.org/wiki/Abstract_machine

https://en.wikipedia.org/wiki/Deterministic_finite_automaton https://en.wikipedia.org/wiki/Nondeterministic_finite_automaton

https://en.wikipedia.org/wiki/Input_(computer_science) https://en.wikipedia.org/wiki/State_(computer_science) https://en.wikipedia.org/wiki/State_machine_replication https://en.wikipedia.org/wiki/State_pattern https://en.wikipedia.org/wiki/Transition_system

https://en.wikipedia.org/wiki/Category:Automata_(computation) https://en.wikipedia.org/wiki/Category:Models_of_computation https://en.wikipedia.org/wiki/Category:Abstract_machines https://en.wikipedia.org/wiki/Category:Finite_automata

• Finite-state machine

• Alternating finite automaton

• Aperiodic finite state automaton

• Asymmetric numeral systems

• Büchi automaton

• Co-Büchi automaton

• Finite state machine with datapath

• Deterministic acyclic finite state automaton

• Deterministic finite automaton

• DFA minimization

• Finite-state transducer

• Flex (lexical analyser generator)

• Foma (software)

• Generalized nondeterministic finite automaton

• Glushkov's construction algorithm

• HFST

• Kleene's algorithm

• Krohn–Rhodes theory

• Levenshtein automaton

• Lex (software)

• Mealy machine

• Moore machine

• Moore reduction procedure

• Muller automaton

• Myhill–Nerode theorem

• Nondeterministic finite automaton

• Ω-automaton

• Permutation automaton

• Powerset construction

• Probabilistic automaton

• Pumping lemma for regular languages

• Quantum finite automata

• Quotient automaton

• RE/flex

• Regular language

• Self-verifying finite automaton

• Semiautomaton

• Separating words problem

• State complexity

• Suffix automaton

• Synchronizing word

• Thompson's construction

• Tree transducer

• Trie

• Tsetlin machine

• Two-way finite automaton

• Unambiguous finite automaton

• Union of two regular languages