Rational \(\omega\)-languages are non-ambiguous

DOI10.1016/0304-3975(83)90086-5zbMath0523.68069OpenAlexW2091227187MaRDI QIDQ1056553

André Arnold

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90086-5

zbMATH Keywords

non-ambiguous automatonrational omega-language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (15)

Choice functions and well-orderings over the infinite binary tree ⋮ Ambiguity in omega context free languages ⋮ Unambiguous Büchi automata. ⋮ Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata ⋮ MSO Logic for Unambiguous Shared-Memory Systems ⋮ Shared-Memory Systems and Charts ⋮ Varieties of finite monoids and Büchi-McNaughton theorem ⋮ UNAMBIGUOUS SHARED-MEMORY SYSTEMS ⋮ Unnamed Item ⋮ On degrees of ambiguity for Büchi tree automata ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ LTL Model Checking of Time-Inhomogeneous Markov Chains ⋮ Automata on infinite trees ⋮ Unnamed Item ⋮ On probabilistic timed automata.

Cites Work

• Almost Deterministic ω-Automata with Existential Output Condition
• Unnamed Item

This page was built for publication: Rational \(\omega\)-languages are non-ambiguous