Similar Items: Boundedness in languages of infinite words
- Infinite and Bi-infinite Words with Decidable Monadic Theories
- Synthesis of Computable Regular Functions of Infinite Words
- An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
- Decidability Results for the Boundedness Problem
- Sub-computable Boundedness Randomness
- Ambiguity Hierarchy of Regular Infinite Tree Languages