Similar Items: Learning Regular Languages over Large Ordered Alphabets
- An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
- Separating Regular Languages with First-Order Logic
- Decision Questions for Probabilistic Automata on Small Alphabets
- The Complexity of Aggregates over Extractions by Regular Expressions
- On Free $omega$-Continuous and Regular Ordered Algebras
- Existential Definability over the Subword Ordering