Codex Wiki
OurBigBook.com
Site
Source code
Deterministic finite automaton
Home
Mathematics
Area of mathematics
Foundations of mathematics
Formal language theory
OurBigBook.com
Words: 192
Articles: 7
A deterministic finite automaton has finitely many states and one transition for each state-symbol pair.
Table of contents
192
7
Extended transition function of a deterministic finite automaton
Deterministic finite automaton
18
Accessible state of a deterministic finite automaton
Deterministic finite automaton
21
Indistinguishable states of a deterministic finite automaton
Deterministic finite automaton
64
1
Quotient deterministic finite automaton by indistinguishable states
Indistinguishable states of a deterministic finite automaton
38
Irreducible deterministic finite automaton
Deterministic finite automaton
74
2
Minimal deterministic finite automaton
Irreducible deterministic finite automaton
56
1
Accessible unary deterministic finite automaton
Minimal deterministic finite automaton
30
Ancestors
(5)
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(5)
Myhill-Nerode equivalence
Solution
Solution
Solution
Pumping lemma for regular languages