Infinite trees and automaton- definable relations over ω-words
- 1 August 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 103 (1) , 143-159
- https://doi.org/10.1016/0304-3975(92)90090-3
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Monadic second order definable relations on the binary treeThe Journal of Symbolic Logic, 1987
- Uniform inevitability is tree automation ineffableInformation Processing Letters, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Two decidability problems for infinite wordsInformation Processing Letters, 1986
- Relations rationnelles infinitairesCalcolo, 1984
- On the bounded monadic theory of well-ordered structuresThe Journal of Symbolic Logic, 1980
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successorThe Journal of Symbolic Logic, 1966
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- Concatenation as a basis for arithmeticThe Journal of Symbolic Logic, 1946