\(\omega\)-languages accepted by finite automata whose structures are cascade products o resets

DOI10.1016/0020-0255(92)90039-BzbMath0736.68054MaRDI QIDQ1183179

Tetsuo Moriya

Publication date: 28 June 1992

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

star-free \(\omega\)-regular languagesstar-free regular sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theories of automata on \(\omega\)-tapes: a simplified approach
• A combinatorial approach to the theory of ω-automata
• Star-free regular sets of ω-sequences
• A Note on Star-Free Events

This page was built for publication: \(\omega\)-languages accepted by finite automata whose structures are cascade products o resets