The following pages link to (Q3739111):
Displaying 30 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Uniform inevitability is tree automaton ineffable (Q1108048) (← links)
- Control of \(\omega\)-automata under state fairness assumptions (Q1128704) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- Complexity of weak acceptance conditions in tree automata. (Q1853134) (← links)
- Pushdown processes: Games and model-checking (Q1854405) (← links)
- Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982) (← links)
- On control of systems modelled as deterministic Rabin automata (Q1902499) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Automata and temporal logic over arbitrary linear time (Q2920121) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- (Q3408128) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Tighter Bounds for the Determinisation of Büchi Automata (Q3617728) (← links)
- (Q4036584) (← links)
- (Q4439449) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- Automated deduction in a graphical temporal logic (Q4868233) (← links)
- Model Theoretic Syntax and Parsing (Q4923571) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- Model Checking-Based Genetic Programming with an Application to Mutual Exclusion (Q5458325) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479274) (← links)
- On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
- Verification by augmented abstraction: The automata-theoretic view (Q5946060) (← links)
- Incremental reasoning on monadic second-order logics with logic programming (Q5963088) (← links)
- Automated temporal reasoning about reactive systems (Q6560389) (← links)
- An automata-theoretic approach to linear temporal logic (Q6560392) (← links)
- Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)
