The following pages link to Alternation (Q3928246):
Displaying 50 items.
- (Q5101338) (← links)
- One-Dimensional Logic over Trees (Q5111281) (← links)
- (Q5136318) (← links)
- (Q5136330) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)
- EXPTIME-complete Decision Problems for Modal and Mixed Specifications (Q5170664) (← links)
- Branching-Time Model-Checking of Probabilistic Pushdown Automata (Q5179051) (← links)
- Playing Savitch and Cooking Games (Q5187817) (← links)
- ON ALTERNATING PHRASE-STRUCTURE GRAMMARS (Q5187849) (← links)
- New results concerning synchronized finite automata (Q5204312) (← links)
- (Q5232899) (← links)
- (Q5232904) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION (Q5249028) (← links)
- Concurrent Dynamic Algebra (Q5277895) (← links)
- The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes (Q5277914) (← links)
- Taming Multirelations (Q5278188) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Sequent Calculus for Intuitionistic Epistemic Logic IEL (Q5283428) (← links)
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions (Q5286060) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
- (Q5376655) (← links)
- 2-Exp Time lower bounds for propositional dynamic logics with intersection (Q5486241) (← links)
- UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE(<font>log log</font> n) (Q5495427) (← links)
- Universal Disjunctive Concatenation and Star (Q5500693) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Linear Parsing Expression Grammars (Q5739004) (← links)
- (Q5743484) (← links)
- (Q5856426) (← links)
- Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)
- Debates with small transparent quantum verifiers (Q5890816) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5892380) (← links)
- A note on one-pebble two-dimensional Turing machines (Q5894928) (← links)
- State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095) (← links)
- A note on one-pebble two-dimensional Turing machines (Q5899349) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5899477) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)
- Complement for two-way alternating automata (Q5919102) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5919539) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5920059) (← links)
- Alternation for sublogarithmic space-bounded alternating pushdown automata (Q5941289) (← links)
- Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
- Converting a Büchi alternating automaton to a usual nondeterministic one (Q5955787) (← links)
- Hyper-polynomial hierarchies and the polynomial jump (Q5958122) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
- On the complexity of verifying concurrent transition systems (Q6044122) (← links)
- Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
- On log-time alternating Turing machines of alternation depth k (Q6085715) (← links)
- Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)
