Pages that link to "Item:Q3325044"
From MaRDI portal
The following pages link to Alternating Pushdown and Stack Automata (Q3325044):
Displaying 49 items.
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- On state-alternating context-free grammars (Q557822) (← links)
- A lower bound for probabilistic algorithms for finite state machines (Q579936) (← links)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
- On the power of alternation in automata theory (Q1068537) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- A grammatical characterization of alternating pushdown automata (Q1123637) (← links)
- Three-dimensional alternating Turing machines with only universal states (Q1129412) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- A survey of space complexity (Q1193412) (← links)
- A characterization of exponential-time languages by alternating context- free grammars (Q1193905) (← links)
- A note on two-way probabilistic automata (Q1195495) (← links)
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations (Q1201150) (← links)
- Communication for alternating machines (Q1203600) (← links)
- Properties of probabilistic pushdown automata (Q1274989) (← links)
- A note on three-dimensional alternating Turing machines with space smaller than \(\log m\) (Q1310925) (← links)
- Refined simulation of multihead automata (Q1339383) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- Width measures of alternating finite automata (Q2096586) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- Quantitative vs. weighted automata (Q2695484) (← links)
- LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata (Q3007638) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- A Survey on Picture-Walking Automata (Q3098039) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- Constructions for alternating finite automata<sup>∗</sup> (Q3477972) (← links)
- On Alternating Phrase-Structure Grammars (Q3540130) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- Yield-languages recognized by alternating tree recognizers (Q3804222) (← links)
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (Q3816981) (← links)
- (Semi)alternating stack automata (Q3959454) (← links)
- Complexity of probabilistic versus deterministic automata (Q4560366) (← links)
- Complexity results for multi-pebble automata and their logics (Q4632417) (← 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)
- Properties of probabilistic pushdown automata (Q5055907) (← links)
- ON ALTERNATING PHRASE-STRUCTURE GRAMMARS (Q5187849) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← 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)
- Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
- Converting finite width AFAs to nondeterministic and universal finite automata (Q6131195) (← links)
