Characterizations of rational -languages by means of right congruences

DOI10.1016/0304-3975(95)80022-2zbMATH Open0873.68115OpenAlexW2087112972MaRDI QIDQ673632FDOQ673632

Authors: Do Long Van, Bertrand Le Saëc, Igor Litovsky 

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

Recommendations

• On syntactic congruences for \(\omega\)-languages
• scientific article; zbMATH DE number 599132
• A syntactic congruence for rational \(\omega\)-languages
• scientific article; zbMATH DE number 512864

zbMATH Keywords

rational \(\omega\)-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A syntactic congruence for rational \(\omega\)-languages
• Testing and generating infinite sequences by a finite automaton
• Finite-state \(\omega\)-languages
• Decision problems forω-automata
• On ω-regular sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
• Saturating right congruences
• Title not available (Why is that?)
• Title not available (Why is that?)
• SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY

Cited In (12)

• Title not available (Why is that?)
• On languages defined by generalized principal right congruences
• Title not available (Why is that?)
• On the minimization problem for \(\omega \)-automata
• Regular \(\omega\)-languages with an informative right congruence
• The greatest fixed-points and rational omega-tree languages
• Title not available (Why is that?)
• Saturating right congruences
• Title not available (Why is that?)
• A syntactic congruence for rational \(\omega\)-languages
• Characterizations of right dense languages
• On syntactic congruences for \(\omega\)-languages

This page was built for publication: Characterizations of rational \(\omega\)-languages by means of right congruences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673632)