Information and Control · 1969 · 10 citations · 3 references
Natural SciencesComputer ScienceMathematicsCombinatoricsSet TheorySyntaxCombinatorial EnumerationEnumerative CombinatoricsGrammarRecursion TheoryRegular LanguagesSyntactic ComplexityEnumerabilityEnumerated TypesRecursive Enumerability
3
Computability and Unsolvability.
Calvin C. Elgot, Martin Davis · Mathematical Tables and Other Aids to Computation · 1959 · 1K citations
The mathematical theory of context-free languages
H. P. Edmundson · Information Storage and Retrieval · 1967 · 738 citations
Computability and Unsolvability.
Louis O. Kattsoff, Martin Davis · American Mathematical Monthly · 1959 · 114 citations