Saturating right congruences

DOI10.1051/ita/1990240605451zbMath0716.68057OpenAlexW124311540MaRDI QIDQ3204049

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)

Related Items (5)

On the minimization problem for ω-automata ⋮ On syntactic congruences for \(\omega\)-languages ⋮ Unnamed Item ⋮ Characterizations of rational \(\omega\)-languages by means of right congruences ⋮ Regular \(\omega\)-languages with an informative right congruence

Cites Work

• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Saturating right congruences