## Rational $$\omega$$-languages are non-ambiguous.(English)Zbl 0523.68069

### MSC:

 68Q45 Formal languages and automata

### Keywords:

non-ambiguous automaton; rational omega-language
Full Text:

### References:

 [1] Eilenberg, S., Automata, languages and machines, Vol. A, (1974), Academic Press New York · Zbl 0317.94045 [2] Karpinski, M., Almost deterministic ω-automata with output condition, Proc. amer. math. soc., 53, 449-452, (1975) · Zbl 0332.02043
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.