Generalized finite automata theory with an application to a decision problem of second-order logic
Authors:
- 1 March 1968
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 2 (1) , 57-81
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963
- Beitrag zur Aerodynamik eines schwingenden Gitters II (Unterschallströmung)ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1962
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- The first order properties of products of algebraic systemsFundamenta Mathematicae, 1959
- Restricted set-theoretical definitions in arithmeticProceedings of the American Mathematical Society, 1958
- Realization of Events by Logical NetsJournal of the ACM, 1958
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935