Category:Finite automata
![]() | Computing portal |
Here is a list of articles in the category Finite automata of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Finite automata"
The following 48 pages are in this category, out of 48 total.
- Finite-state machine (computing)
A
- Alternating finite automaton (computing)
- Aperiodic finite state automaton (computing)
- Asymmetric numeral systems (computing)
B
- Büchi automaton (computing)
C
- Co-Büchi automaton (computing)
D
- Finite-state machine with datapath (computing)
- Deterministic acyclic finite state automaton (computing)
- Deterministic finite automaton (computing)
- DFA minimization (computing)
F
- Finite-state transducer (computing)
- Flex (lexical analyser generator) (software)
- Foma (software)
G
- Generalized nondeterministic finite automaton (computing)
- Glushkov's construction algorithm (computing)
H
- HFST (software)
K
- Kleene's algorithm (computing)
- Krohn–Rhodes theory (computing)
L
- Levenshtein automaton (computing)
- Lex (software)
M
- Mealy machine (computing)
- Moore machine (computing)
- Moore reduction procedure (computing)
- Muller automaton (computing)
- Myhill–Nerode theorem (computing)
N
- NFA to DFA conversion (computing)
- Nondeterministic finite automaton (computing)
O
- Ω-automaton (computing)
P
- Permutation automaton (computing)
- Powerset construction (computing)
- Probabilistic automaton (computing)
- Pumping lemma for regular languages (computing)
Q
- Quantum finite automata (computing)
- Quotient automaton (computing)
R
- Regular language (computing)
S
- Self-verifying finite automaton (computing)
- Semiautomaton (computing)
- Separating words problem (computing)
- State complexity (computing)
- Suffix automaton (computing)
- Synchronizing word (computing)
T
- Thompson's construction (computing)
- Tree transducer (computing)
- Trie (computing)
- Tsetlin machine (computing)
- Two-way finite automaton (computing)
U
- Unambiguous finite automaton (computing)
- Union of two regular languages (computing)