Journal of the ACM · 1965 · 72 citations · 6 references
ComputingComputer ScienceCompilersProgramming LanguagesSyntaxRegular LanguagesTuring Machines
Several devices with two input lines and one output line are introduced. These devices are viewed as transformations which operate on pairs of (ALGOL-like) languages. Among the results proved are the following: (i) a pair consisting of a language and a regular set is transformed into a language; (ii) let ( V, W ) be a pair consisting of a language and a regular set. Then the set of those words w 1 , for which there exists a word w 2 in V so that ( w 1 , w 2 ) is mapped into W , is a language.
6
Finite Automata and Their Decision Problems
M. O. Rabin, D. Scott · IBM Journal of Research and Development · 1959 · 1.9K citations
On certain formal properties of grammars
Noam Chomsky · Information and Control · 1959 · 1.6K citations
Two Families of Languages Related to ALGOL
Seymour Ginsburg, H. Gordon Rice · Journal of the ACM · 1962 · 288 citations · Full text