Rational Ω-languages are non-ambiguous
- 30 September 1983
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 26 (1-2) , 221-223
- https://doi.org/10.1016/0304-3975(83)90086-5
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Almost Deterministic ω-Automata with Existential Output ConditionProceedings of the American Mathematical Society, 1975