The following pages link to Unambiguous Büchi automata. (Q1401292):
Displayed 25 items.
- Schützenberger and Eilenberg theorems for words on linear orderings (Q414913) (← links)
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata (Q436610) (← links)
- Normality and automata (Q494059) (← links)
- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words (Q832937) (← links)
- Regular transducer expressions for regular transformations (Q2064527) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- Green's relations in deterministic finite automata (Q2311884) (← links)
- Green's relations in finite transformation semigroups (Q2399369) (← links)
- Shared-Memory Systems and Charts (Q3007636) (← links)
- Valuations of Weighted Automata: Doing It in a Rational Way (Q3098044) (← links)
- MSO Logic for Unambiguous Shared-Memory Systems (Q3533037) (← links)
- UNAMBIGUOUS SHARED-MEMORY SYSTEMS (Q3586410) (← links)
- LTL Model Checking of Time-Inhomogeneous Markov Chains (Q3648693) (← links)
- (Q5021011) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- (Q5090969) (← links)
- Backward Deterministic Büchi Automata on Infinite Words (Q5136295) (← links)
- FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES (Q5247178) (← links)
- From LTL to Symbolically Represented Deterministic Automata (Q5452723) (← links)
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS (Q5462675) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- Representing regular languages of infinite words using mod 2 multiplicity automata (Q6141755) (← links)
- Forbidden Patterns for FO<sup>2</sup> Alternation Over Finite and Infinite Words (Q6169964) (← links)