Almost Deterministic ω-Automata with Existential Output Condition

DOI10.2307/2040034MaRDI QIDQ4096929zbMATH OpenOpenAlexFDO

Authors Marek Karpinski

Publication date 1975

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2040034

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cited in

(2)

• A power-set construction for reducing Büchi automata to non-determinism degree two
• Rational \(\omega\)-languages are non-ambiguous

This page was built for publication: Almost Deterministic ω-Automata with Existential Output Condition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096929)