Proof — NFA–DFA equivalence
Statement
Nondeterministic finite automata; Rabin–Scott theorem. Proved in ZFC.
Source
ACM Turing Award 1976. Nondeterministic finite automata; Rabin–Scott theorem. Proved in ZFC.
Domains
computer-science
Nondeterministic finite automata; Rabin–Scott theorem. Proved in ZFC.
ACM Turing Award 1976. Nondeterministic finite automata; Rabin–Scott theorem. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/proof/rabin-turing-1976/