The following pages link to (Q4536446):
Displaying 12 items.
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Alternating finite automata on \(\omega\)-words (Q796990) (← links)
- Adapting behaviors via reactive synthesis (Q832238) (← links)
- Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
- Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
- Regular \(\omega\)-languages with an informative right congruence (Q2029605) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata (Q2200844) (← links)
- LTL to self-loop alternating automata with generic acceptance and back (Q2202003) (← links)
- (Q3748266) (← links)
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703760) (← links)
