The following pages link to Alternation (Q3928246):
Displaying 50 items.
- Parallel random access machines with powerful instruction sets (Q3959429) (← links)
- (Semi)alternating stack automata (Q3959454) (← links)
- (Q4016418) (← links)
- Complexity of E0L structural equivalence (Q4359286) (← links)
- A hierarchy that does not collapse : alternations in low level space (Q4365021) (← links)
- Domain mu-calculus (Q4460689) (← links)
- Discrete-time control for rectangular hybrid automata (Q4571988) (← links)
- The computational complexity of deciding whether a finite algebra generates a minimal variety (Q4586419) (← links)
- Max Euwe's Set-Theoretic Observations on the Game of Chess — Introductory Notes (Q4598040) (← links)
- Computing on structures (Q4630296) (← links)
- Complexity results for multi-pebble automata and their logics (Q4632417) (← links)
- Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete (Q4639894) (← links)
- Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
- Consensus Game Acceptors and Iterated Transductions (Q4640036) (← links)
- The complexity of searching succinctly represented graphs (Q4645179) (← links)
- OWL 2 Profiles: An Introduction to Lightweight Ontology Languages (Q4647815) (← links)
- A NOTE ON REBOUND TURING MACHINES (Q4667926) (← links)
- Alternating time versus deterministic time: A separation (Q4717057) (← links)
- ON THE COMPLEXITY OF COALITIONAL REASONING (Q4795949) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- The Communication Hierarchy of Time and Space Bounded Parallel Machines (Q4825478) (← links)
- Equations and regular-like expressions for afa (Q4839734) (← links)
- On the power of 1-tape off-line ATMs running in a bounded number of reversals (Q4841767) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- On balanced versus unbalanced computation trees (Q4887490) (← links)
- CaRet With Forgettable Past (Q4982130) (← links)
- The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic (Q4989164) (← links)
- (Q4989405) (← links)
- On the complexity of team logic and its two-variable fragment (Q5005127) (← links)
- Spanning-Tree Games. (Q5005136) (← links)
- (Q5009427) (← links)
- (Q5013876) (← links)
- (Q5015274) (← links)
- (Q5015279) (← links)
- (Q5018515) (← links)
- (Q5020996) (← links)
- Combining Partial Specifications using Alternating Interface Automata (Q5039544) (← links)
- Properties of probabilistic pushdown automata (Q5055907) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- Canonical Models and the Complexity of Modal Team Logic (Q5079755) (← links)
- Results on alternating-time temporal logics with linear past (Q5079770) (← links)
- (Q5089032) (← links)
- Datalog: Bag Semantics via Set Semantics (Q5091129) (← links)
- (Q5092374) (← links)
- Reversals and alternation (Q5096156) (← links)
- Deciding equivalence of finite tree automata (Q5096180) (← links)
- Locally definable acceptance types for polynomial time machines (Q5096782) (← links)
- Inductive counting below logspace (Q5096885) (← links)
- Empty alternation (Q5096908) (← links)
