The following pages link to Alternation (Q3928246):
Displaying 50 items.
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- A note on the emptiness problem for alternating finite-memory automata (Q2437765) (← links)
- On some derivation mechanisms and the complexity of their Szilard languages (Q2453536) (← links)
- Visibly rational expressions (Q2453980) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- Analysis of dynamic policies (Q2482441) (← links)
- Tableaux for constructive concurrent dynamic logic (Q2488268) (← links)
- Alternating automata and temporal logic normal forms (Q2488275) (← links)
- Model checking propositional dynamic logic with all extras (Q2494725) (← links)
- Typing in reflective combinatory logic (Q2498910) (← links)
- On complexity of verification of interacting agents' behavior (Q2498917) (← links)
- Some properties of one-pebble Turing machines with sublogarithmic space (Q2566005) (← links)
- Generation problems (Q2575749) (← links)
- The complexity of online manipulation of sequential elections (Q2637642) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- Self-reducibility (Q2639637) (← links)
- Positive relativizations for log space computability (Q2639638) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- A tableau construction for finite linear-time temporal logic (Q2669249) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- Complexity of planning for connected agents in a partially known environment (Q2680862) (← links)
- Quantitative vs. weighted automata (Q2695484) (← links)
- A space lower bound for acceptance by one-way \(\Pi_2\)-alternating machines (Q2720409) (← links)
- New results on the minimum amount of useful space (Q2814840) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition (Q2842604) (← links)
- Soft linear logic and polynomial complexity classes (Q2866738) (← links)
- Turing Machines for Dummies (Q2891358) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- The Complexity of One-Agent Refinement Modal Logic (Q2915064) (← links)
- LINEAR CONJUNCTIVE GRAMMARS AND ONE-TURN SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA (Q2941092) (← links)
- Complexity of Propositional Independence and Inclusion Logic (Q2946342) (← links)
- LoCo—A Logic for Configuration Problems (Q2946729) (← links)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Recent Advances in Datalog$$^\pm $$ (Q2970309) (← links)
- A rewriting framework and logic for activities subject to regulations (Q2973251) (← links)
- Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism (Q2974777) (← links)
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra (Q3005988) (← links)
- Consensual languages and matching finite-state computations (Q3006160) (← links)
- LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata (Q3007638) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281) (← links)
