Pages that link to "Item:Q673778"
From MaRDI portal
The following pages link to Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778):
Displaying 35 items.
- Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- Visibly pushdown modular games (Q515657) (← links)
- On mathematical contributions of Paul E. Schupp (Q716386) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Distributed synthesis for well-connected architectures (Q842581) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- Observations on determinization of Büchi automata (Q860867) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- From liveness to promptness (Q1039845) (← links)
- A decidable class of problems for control under partial observation (Q1041809) (← links)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees (Q1276252) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- Graded modalities in strategy logic (Q1641034) (← links)
- Model-checking iterated games (Q1674862) (← links)
- Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Automata on infinite trees (Q2074210) (← links)
- Determinization and limit-determinization of Emerson-Lei automata (Q2147175) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Dynamic control with indistinguishable events (Q2256883) (← links)
- Complete axiomatization and decidability of alternating-time temporal logic (Q2368988) (← links)
- Dicing on the Streett (Q2379984) (← links)
- Automata and fixed point logic: a coalgebraic perspective (Q2495648) (← links)
- Relating word and tree automata (Q2576943) (← links)
- ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH (Q2909221) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- State of Büchi Complementation (Q3073645) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- New Optimizations and Heuristics for Determinization of Büchi Automata (Q3297598) (← links)
- SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS (Q3426790) (← links)
- On the Way to Alternating Weak Automata (Q5090957) (← links)
- (Q5092321) (← links)
