Literal shuffle on \(\omega\)-languages

DOI10.1016/0020-0190(96)00091-9zbMath0875.68602OpenAlexW2051491043MaRDI QIDQ671414

Hideki Yamasaki, Tetsuo Moriya

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00091-9

zbMATH Keywords

\(\omega\)-regular languageDuoLiteral shuffleShuffle

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
• A note on \(\omega\)-regular languages
• Literal shuffle
• Accepting conditions for automata on \(\omega\)-languages
• Two characterizations of rational adherences
• Closure properties of subclasses of ω-regular languages under morphism and inverse morphism