Characterizations of rational \(\omega\)-languages by means of right congruences
From MaRDI portal
Publication:673632
DOI10.1016/0304-3975(95)80022-2zbMath0873.68115OpenAlexW2087112972MaRDI QIDQ673632
Igor Litovsky, Bertrand Le Saëc, Do Long Van
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)80022-2
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Related Items
On syntactic congruences for \(\omega\)-languages ⋮ Unnamed Item ⋮ Regular \(\omega\)-languages with an informative right congruence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-state \(\omega\)-languages
- The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
- A syntactic congruence for rational \(\omega\)-languages
- Saturating right congruences
- On ω-regular sets
- SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY
- Decision problems forω-automata
- Testing and generating infinite sequences by a finite automaton