Questions tagged [finite-automaton]
The finite-automaton tag has no summary.
2 questions
7
votes
2
answers
397
views
McNaughton-Yamada-Thompson algorithm for converting regex to NDFA
The McNaughton-Yamada-Thompson algorithm (aka. Thompson algorithm) is designed to transform a regular expression into a Non-Deterministic Finite Automaton (NDFA) that recognizes the language ...
- 469
1
vote
0
answers
74
views
Brzozowski Algebraic Method for converting finite automaton from NFA to DFA
The Brzozowski Algebraic Method is a technique used in automata theory, specifically for constructing the minimal deterministic finite automaton (DFA) from a given nondeterministic finite automaton (...
- 469