The complexity of automata and subtheories of monadic second order arithmetics
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 453-466
- https://doi.org/10.1007/3-540-10854-8_49
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On ω-regular setsInformation and Control, 1979
- Decidable Theories IILecture Notes in Mathematics, 1973
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966