The following pages link to Alternation (Q3928246):
Displaying 50 items.
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- On the Complexity of Szilard Languages of Regulated Grammars (Q3105746) (← links)
- Automatic structures of bounded degree revisited (Q3107359) (← links)
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results (Q3142269) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- FO Model Checking on Nested Pushdown Trees (Q3182946) (← links)
- Shrinking and Expanding Cellular Automata (Q3186482) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- Expressivity and Complexity of MongoDB Queries (Q3305353) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- Towards separating nondeterminism from determinism (Q3334987) (← links)
- The role of rudimentary relations in complexity theory (Q3347299) (← links)
- (Q3384161) (← links)
- (Q3384177) (← links)
- On Models of a Nondeterministic Computation (Q3392968) (← links)
- Edit Distance for Pushdown Automata (Q3449470) (← links)
- On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (Q3449493) (← links)
- SAFE RECURSIVE SET FUNCTIONS (Q3450802) (← links)
- Consensus Game Acceptors (Q3451093) (← links)
- Constructions for alternating finite automata<sup>∗</sup> (Q3477972) (← links)
- Computational structure of GPSG models (Q3490968) (← links)
- SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA (Q3503089) (← links)
- Traces of term-automatic graphs (Q3526420) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- WIRELESS MOBILE COMPUTING AND ITS LINKS TO DESCRIPTIVE COMPLEXITY (Q3526542) (← links)
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (Q3533004) (← links)
- More Concise Representation of Regular Languages by Automata and Regular Expressions (Q3533024) (← links)
- Run-Time Monitoring of Electronic Contracts (Q3540088) (← links)
- Deterministic Input-Reversal and Input-Revolving Finite Automata (Q3540102) (← links)
- On Alternating Phrase-Structure Grammars (Q3540130) (← links)
- An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
- Recursion Schemata for NC k (Q3540170) (← links)
- The Complexity of Conjunctive Query Answering in Expressive Description Logics (Q3541701) (← links)
- Infinite Runs in Weighted Timed Automata with Energy Constraints (Q3543286) (← links)
- Modal and mixed specifications: key decision problems and their complexities (Q3550702) (← links)
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Factoring and Testing Primes in Small Space (Q3599080) (← links)
- PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
- Coalgebraic Hybrid Logic (Q3617726) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Fixpoint Guided Abstraction Refinement for Alternating Automata (Q3637352) (← links)
- Universal quantifiers and time complexity of random access machines (Q3699679) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- Possibilities of various types of alternating automata (Q3787476) (← links)
- Yield-languages recognized by alternating tree recognizers (Q3804222) (← links)
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (Q3816981) (← links)
- COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE (Q3839875) (← links)
