Pages that link to "Item:Q3549125"
From MaRDI portal
The following pages link to Weak alternating automata are not that weak (Q3549125):
Displayed 48 items.
- Bounded model checking of ETL cooperating with finite and looping automata connectives (Q364388) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
- Mediating for reduction (on minimizing alternating Büchi automata) (Q740970) (← links)
- Fuzzy alternating automata over distributive lattices (Q781276) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces (Q988553) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- From complementation to certification (Q2575735) (← links)
- Büchi Store: An Open Repository of Büchi Automata (Q3000654) (← links)
- Büchi Automata Can Have Smaller Quotients (Q3012925) (← links)
- State of Büchi Complementation (Q3073645) (← links)
- Advanced Ramsey-Based Büchi Automata Inclusion Testing (Q3090830) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL (Q3183543) (← links)
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata (Q3303906) (← links)
- (Q3384901) (← links)
- Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
- SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA (Q3503089) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- Büchi Complementation and Size-Change Termination (Q3617751) (← links)
- (Q4989409) (← links)
- (Q5021011) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- Propositional Dynamic Logic for Hyperproperties (Q5089318) (← links)
- On the Way to Alternating Weak Automata (Q5090957) (← links)
- (Q5114824) (← links)
- Coinductive Algorithms for Büchi Automata (Q5158653) (← links)
- Random Models for Evaluating Efficient Büchi Universality Checking (Q5224494) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- Lattice Automata (Q5452607) (← links)
- GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic (Q5458337) (← links)
- BÜCHI COMPLEMENTATION MADE TIGHTER (Q5484906) (← links)
- (Q5875379) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- Towards a grand unification of Büchi complementation constructions (Q6113976) (← links)
- On the translation of automata to linear temporal logic (Q6181926) (← links)