Pages that link to "Item:Q1199531"
From MaRDI portal
The following pages link to Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531):
Displaying 14 items.
- An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma (Q672383) (← links)
- Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
- How to decide continuity of rational functions on infinite words (Q1589419) (← links)
- A characterization of Büchi tree automata (Q1847374) (← links)
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus (Q2946334) (← links)
- Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall (Q3393383) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions (Q3601787) (← links)
- Monadic second order definable relations on the binary tree (Q3764124) (← links)
- (Q3975166) (← links)
- (Q4202958) (← links)
- Generalized rational relations and their logical definability (Q5055929) (← links)
- Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words (Q5384126) (← links)