Infinite-word languages and continuous mappings

Decidability of second-order theories and automata on infinite trees.

Michael O. Rabin · Transactions of the American Mathematical Society · 1969 · 1.2K citations · Full text

Computing, Computer Science, Mathematics +13

Data Types as Lattices

Dana Scott · SIAM Journal on Computing · 1976 · 573 citations

Computing, Computer Science, Number Theory +8

Solving sequential conditions by finite-state strategies

J Büchi, Lawrence H. Landweber · Transactions of the American Mathematical Society · 1969 · 272 citations · Full text

Computing, Computer Science, Mathematics +12

Decision problems forω-automata

Lawrence H. Landweber · Theory of Computing Systems · 1969 · 259 citations

Theories of automata on ω-tapes: A simplified approach

Yaacov Choueka · Journal of Computer and System Sciences · 1974 · 210 citations

Computing, Computer Science, Formal Methods +9