Classifying regular events in symbolic logic

Weak Second‐Order Arithmetic and Finite Automata

J Büchi · Mathematical logic quarterly · 1960 · 819 citations

Computing, Computer Science, Mathematics +9

An application of games to the completeness problem for formalized theories

Andrzej Ehrenfeucht · Fundamenta Mathematicae · 1961 · 613 citations · Full text

Computing, Computer Science, Mathematics +14

Decision problems of finite automata design and related arithmetics

Calvin C. Elgot · Transactions of the American Mathematical Society · 1961 · 443 citations

Computing, Computer Science, Algorithms +9

Characterizations of locally testable events

Janusz Brzozowski, Imre Simon · Discrete Mathematics · 1973 · 211 citations

Natural Sciences, Mathematics, Probability Theory +5

Dot-depth of star-free events

Rina Cohen, Janusz Brzozowski · Journal of Computer and System Sciences · 1971 · 162 citations

Natural Sciences, Computer Science, Physics +2