Finite Automata and Their Decision Problems¶
Rabin, M. O., & Scott, D. (1959). Finite Automata and Their Decision Problems. IBM Journal of Research and Development, 3(2), 114-125.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Nondeterministic Finite Automaton
- This is an existential rule, not a probability assigned to the word and not a claim that a physical machine guesses correctly.
This sourceTheir definition permits a set of initial states and explicitly says the model is not probabilistic.
- This is an existential rule, not a probability assigned to the word and not a claim that a physical machine guesses correctly.
- Powerset Construction
- Rabin and Scott defined this construction and proved the language equivalence in their original 1959 paper.
This sourceTheir original definition has no explicit $\varepsilon$-transitions.
- Rabin and Scott defined this construction and proved the language equivalence in their original 1959 paper.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:e791fd3c8154 · see in the full table