Introduction to Automata Theory, Languages, and Computation
Citations
7,184 citations
7,096 citations
6,340 citations
Cites background or methods from "Introduction to Automata Theory, La..."
...An interesting connection lies between the ideas of this chapter and the theory of finite automata, which is part of the theory of computation (see [465, 892])....
[...]
...To interpret these bounds a basic understanding of the theory of computation is required [465, 892]....
[...]
...The Church-Turing thesis states that an algorithm is a Turing machine (see [465, 892] for more details)....
[...]
4,905 citations
Cites background from "Introduction to Automata Theory, La..."
...For other algorithms on finite automata, a detailed description of the techniques sketched here and other aspects of regular languages, we refer to the text books [272, 363, 214, 383] and the literature mentioned therein....
[...]
References
1,799 citations
"Introduction to Automata Theory, La..." refers background or methods in this paper
...Notably, [3] introduces the "LR(A) grammars," a subclass of CFG's that generate exactly the DPDA languages....
[...]
...The conventional DFA was independently proposed, in several similar variations, by [1], [3], and [4]....
[...]
...In addition [6] is the source for the nonclosure under intersection and complementation, and [3] provides additional closure results, including closure of the CFL's under inverse homomorphism....
[...]
...[3] and [8] treat a number of other complexity classes not mentioned here....
[...]
...All these were preceded by the work of Godel [3], which in effect showed that there was no way for a computer to answer all mathematical questions....
[...]