Saturating right congruences

DOI10.1051/ITA/1990240605451MaRDI QIDQ3204049zbMATH OpenOpenAlexFDO

Authors Bertrand Le Saëc

Publication date 1990

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92375

zbMATH Keywords

\(\omega \) -languagesMuller automataTable-transition automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Characterizations of rational \(\omega\)-languages by means of right congruences
• A syntactic congruence for rational \(\omega\)-languages
• On syntactic congruences for \(\omega\)-languages
• scientific article; zbMATH DE number 3990900
• scientific article; zbMATH DE number 604887

Cites work

• scientific article; zbMATH DE number 3990900 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton

Cited in

(7)

• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
• scientific article; zbMATH DE number 7447748 (Why is no real title available?)
• Half-positional objectives recognized by deterministic Büchi automata
• Regular \(\omega\)-languages with an informative right congruence
• On the minimization problem for \(\omega \)-automata
• On syntactic congruences for \(\omega\)-languages
• Characterizations of rational \(\omega\)-languages by means of right congruences

This page was built for publication: Saturating right congruences

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