Rational \(\omega\)-languages are non-ambiguous
From MaRDI portal
Publication:1056553
DOI10.1016/0304-3975(83)90086-5zbMath0523.68069MaRDI QIDQ1056553
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
68Q45: Formal languages and automata
Related Items
Unnamed Item, Unnamed Item, Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata, Choice functions and well-orderings over the infinite binary tree, Varieties of finite monoids and Büchi-McNaughton theorem, Ambiguity in omega context free languages, Unambiguous Büchi automata., On probabilistic timed automata., On degrees of ambiguity for Büchi tree automata, Automata on infinite trees, Shared-Memory Systems and Charts, Valuations of Weighted Automata: Doing It in a Rational Way, MSO Logic for Unambiguous Shared-Memory Systems, UNAMBIGUOUS SHARED-MEMORY SYSTEMS, LTL Model Checking of Time-Inhomogeneous Markov Chains
Cites Work