Saturating right congruences

DOI10.1051/ITA/1990240605451zbMATH Open0716.68057OpenAlexW124311540MaRDI QIDQ3204049FDOQ3204049

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Testing and generating infinite sequences by a finite automaton
• Decision problems forω-automata
• Title not available (Why is that?)

Cited In (7)

• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
• Title not available (Why is that?)
• Half-positional objectives recognized by deterministic Büchi automata
• On the minimization problem for \(\omega \)-automata
• Regular \(\omega\)-languages with an informative right congruence
• 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)