Pages that link to "Item:Q5277722"
From MaRDI portal
The following pages link to From linear time to branching time (Q5277722):
Displayed 15 items.
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- New Optimizations and Heuristics for Determinization of Büchi Automata (Q3297598) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems (Q3646256) (← links)
- On Repetition Languages (Q5089230) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- (Q5136340) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- TYPENESS FOR ω-REGULAR AUTOMATA (Q5484907) (← links)
- (Q5743484) (← links)
- \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes (Q6077844) (← links)