Almost Deterministic ω-Automata with Existential Output Condition

DOI10.2307/2040034zbMath0332.02043OpenAlexW4253468254MaRDI QIDQ4096929

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)

Related Items (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