Init and Anf operating on \(\omega\)-languages

DOI10.1016/0020-0190(83)90101-1zbMath0522.68066OpenAlexW2069263027MaRDI QIDQ1056238

Rudolf Freund

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90101-1

zbMATH Keywords

omega-languageAnfInitomega-Kleene closureprefixes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Infinite-word languages and continuous mappings

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of \(\omega\)-type Turing acceptors
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
• \(\omega\)-computations on Turing machines
• \(\omega\)-computations on deterministic pushdown machines
• Language operators related to Init
• Automata in general algebras

This page was built for publication: Init and Anf operating on \(\omega\)-languages