Automata on infinite objects and their applications to logic and programming
- 1 October 1989
- journal article
- Published by Elsevier in Information and Computation
- Vol. 83 (1) , 41-64
- https://doi.org/10.1016/0890-5401(89)90046-1
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)Information and Control, 1985
- Pushdown tree automataTheory of Computing Systems, 1983
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- AlternationJournal of the ACM, 1981
- Formal computations of non deterministic recursive program schemesTheory of Computing Systems, 1979
- Algorithm = logic + controlCommunications of the ACM, 1979
- Theory of ω-languages. II: A study of various models of ω-type generation and recognitionJournal of Computer and System Sciences, 1977
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- The minimalization of tree automataInformation and Control, 1968
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966