Similar Items: An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
- Decision Questions for Probabilistic Automata on Small Alphabets
- Learning Regular Languages over Large Ordered Alphabets
- Infinite and Bi-infinite Words with Decidable Monadic Theories
- Boundedness in languages of infinite words
- A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
- On the decidability and complexity of Metric Temporal Logic over finite words