Representation of events in nerve nets and finite automata¶
Kleene, S. C. (1956). Representation of events in nerve nets and finite automata. Automata Studies.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Closure
- … and identity-string inclusion; the regular languages over a finite alphabet are precisely the languages constructible from finite languages via union, concatenation, and Kleene closure, and Kleene (1956) establishes this closure-theoretic characterisation as one of the foundational results of automata theory.
This sourceOriginating treatment characterising the regular languages as the smallest class containing the finite languages and closed under union, concatenation, and Kleene star; establishes the closure-theoretic / automaton-theoretic / regular-expression equivalence.
- … and identity-string inclusion; the regular languages over a finite alphabet are precisely the languages constructible from finite languages via union, concatenation, and Kleene closure, and Kleene (1956) establishes this closure-theoretic characterisation as one of the foundational results of automata theory.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no 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:1651d8aabe24 · see in the full table