Pages that link to "Item:Q796990"
From MaRDI portal
The following pages link to Alternating finite automata on \(\omega\)-words (Q796990):
Displaying 50 items.
- Optimal constructions for active diagnosis (Q314815) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Parametric linear dynamic logic (Q515660) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Observations on determinization of Büchi automata (Q860867) (← links)
- Pushdown module checking (Q968362) (← links)
- On regular temporal logics with past (Q977176) (← links)
- Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces (Q988553) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Complexity and succinctness issues for linear-time hybrid logics (Q1044839) (← links)
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- On alternating \(\omega\)-automata (Q1109572) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- NP reasoning in the monotone \(\mu\)-calculus (Q2096471) (← links)
- Determinization and limit-determinization of Emerson-Lei automata (Q2147175) (← links)
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains (Q2331081) (← links)
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems (Q2408742) (← links)
- Alternating automata and temporal logic normal forms (Q2488275) (← links)
- From complementation to certification (Q2575735) (← links)
- Robust, expressive, and quantitative linear temporal logics: pick any two for free (Q2672232) (← links)
- Automatic winning shifts (Q2672264) (← links)
- Model Checking Information Flow in Reactive Systems (Q2891409) (← links)
- Hybrid and First-Order Complete Extensions of CaRet (Q3010360) (← links)
- Size-Change Termination and Satisfiability for Linear-Time Temporal Logics (Q3172880) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- New Optimizations and Heuristics for Determinization of Büchi Automata (Q3297598) (← links)
- Width of Non-deterministic Automata (Q3304146) (← links)
- COMPUTING CONVEX HULLS BY AUTOMATA ITERATION (Q3395136) (← links)
- SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA (Q3503089) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- Complexity and Succinctness Issues for Linear-Time Hybrid Logics (Q3532457) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- On the Strength of Unambiguous Tree Automata (Q4683238) (← links)
- Model-checking Timed Temporal Logics (Q4982129) (← links)
- (Q5021011) (← links)
- Propositional Dynamic Logic for Hyperproperties (Q5089318) (← links)
- A Characterisation of Pi^0_2 Regular Tree Languages (Q5111272) (← links)
- Rabin vs. Streett Automata (Q5136307) (← links)
- (Q5207047) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- Lattice Automata (Q5452607) (← links)
- TYPENESS FOR ω-REGULAR AUTOMATA (Q5484907) (← links)
- A Decision Procedure for CTL* Based on Tableaux and Automata (Q5747771) (← links)
