Two iteration theorems for some families of languages

On Relations Defined by Generalized Finite Automata

Calvin C. Elgot, J. E. Mezei · IBM Journal of Research and Development · 1965 · 315 citations

Computing, Computer Science, Mathematics +13

Bounded Algol-Like Languages

Seymour Ginsburg, Edwin H. Spanier · Transactions of the American Mathematical Society · 1964 · 249 citations

Rational sets in commutative monoids

Samuel Eilenberg, M. P. Schützenberger · Journal of Algebra · 1969 · 222 citations

Natural Sciences, Mathematics, Algebra +10

A helpful result for proving inherent ambiguity

W. David Ogden · Theory of Computing Systems · 1968 · 158 citations

Computing, Computer Science, Algorithms +3

Studies in abstract families of languages

Seymour Ginsburg, Sheila A. Greibach, John E. Hopcroft · Memoirs of the American Mathematical Society · 1969 · 133 citations

Language Studies, Computer Science, Linguistics +11