The following pages link to (Q3995303):
Displaying 21 items.
- Undecidability through Fourier series (Q278759) (← links)
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
- On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees (Q1276252) (← links)
- Infinite games played on finite graphs (Q1314640) (← links)
- On the structure of varieties with equationally definable principal congruences. III (Q1342132) (← links)
- Construction of some nonautomatic sequences by cellular automata (Q1656693) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- McNaughton games and extracting strategies for concurrent programs (Q1919769) (← links)
- Automata on finite trees (Q2074209) (← links)
- Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
- On store languages and applications (Q2417850) (← links)
- An extension of Büchi’s problem for polynomial rings in zero characteristic (Q3558983) (← links)
- A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time (Q3643267) (← links)
- An effective version of Stallings' theorem in the case of context-free groups (Q4630285) (← links)
- Equality Logic (Q5147753) (← links)
- Coinductive Algorithms for Büchi Automata (Q5158653) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- A first-order logic characterization of safety and co-safety languages (Q6135783) (← links)
- Monadic monadic second order logic (Q6612795) (← links)
- The monadic theory of toric words (Q6652470) (← links)
