Similar Items: Infinite and Bi-infinite Words with Decidable Monadic Theories
- A Functional (Monadic) Second-Order Theory of Infinite Trees
- Boundedness in languages of infinite words
- Synthesis of Computable Regular Functions of Infinite Words
- The Complexity of Infinite Computations In Models of Set Theory
- The Theory of Universal Graphs for Infinite Duration Games
- An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet