Classifying regular events in symbolic logic
- 1 December 1982
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 25 (3) , 360-376
- https://doi.org/10.1016/0022-0000(82)90016-2
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The theory of successor with an extra predicateMathematische Annalen, 1978
- The dot-depth hierarchy of star-free languages is infiniteJournal of Computer and System Sciences, 1978
- Application of model theoretic games to discrete linear orders and finite automataInformation and Control, 1977
- Characterizations of locally testable eventsDiscrete Mathematics, 1973
- Dot-depth of star-free eventsJournal of Computer and System Sciences, 1971
- Transition graphs and the star-height of regular events.The Michigan Mathematical Journal, 1963
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960