The following pages link to (Q5618355):
Displaying 23 items.
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Schützenberger and Eilenberg theorems for words on linear orderings (Q414913) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Prefix-free languages as \(\omega\)-generators (Q751290) (← links)
- Finite-state \(\omega\)-languages (Q794443) (← links)
- A power-set construction for reducing Büchi automata to non-determinism degree two (Q845908) (← links)
- Automata on linear orderings (Q859978) (← links)
- Towards a formal proof system for \(\omega\)-rational expressions (Q1064076) (← links)
- First-order logic and star-free sets (Q1088982) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- Finitely generated \(\omega\)-languages (Q1092671) (← links)
- Finite automata on directed graphs (Q1191024) (← links)
- Theories of automata on \(\omega\)-tapes: a simplified approach (Q1211504) (← links)
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages (Q1240574) (← links)
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575) (← links)
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes (Q1249573) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- The monadic theory of finite representations of infinite words (Q2379951) (← links)
- On von Neumann regular rings with an automorphism (Q2456173) (← links)
- Tree acceptors and some of their applications (Q2544414) (← links)
- Monadic Second Order Logic And Its Fragments (Q4923546) (← links)
- Complementing Büchi Automata with Ranker (Q6487336) (← links)
