On syntactic congruences for \(\omega\)-languages
From MaRDI portal
Publication:1391139
DOI10.1016/S0304-3975(96)00312-XzbMath0911.68145MaRDI QIDQ1391139
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Automata Theory and Model Checking, Learning regular omega languages, Inferring regular languages and \(\omega\)-languages, On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words, Towards a grand unification of Büchi complementation constructions, Mechanizing the Powerset Construction for Restricted Classes of ω-Automata, A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages, Unnamed Item, First-Order Logic and Numeration Systems, Unnamed Item, Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract), Regular \(\omega\)-languages with an informative right congruence, A Myhill-Nerode theorem for register automata and symbolic trace languages, The disjunctivities of \(\omega\)-languages., Unnamed Item, TYPENESS FOR ω-REGULAR AUTOMATA, Relating word and tree automata, Efficient minimization of deterministic weak \(\omega\)-automata, Shift-invariant topologies for the Cantor space \(X^{\omega}\)
Cites Work
- Characterizations of rational \(\omega\)-languages by means of right congruences
- Finite-state \(\omega\)-languages
- A syntactic congruence for rational \(\omega\)-languages
- \(X\)-automata on \(\omega\)-words
- On the learnability of infinitary regular sets
- Saturating right congruences
- On?-Languages whose syntactic monoid is trivial
- On ω-regular sets
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- Finite automata and the logic of one-place predicates
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
