The following pages link to One-way stack automata (Q5557460):
Displaying 39 items.
- On the extension of Gladkij's theorem and the hierarchies of languages (Q2557560) (← links)
- Sublogarithmic ambiguity (Q2575762) (← links)
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata (Q2695283) (← links)
- Set automata (Q2814837) (← links)
- Deterministic Stack Transducers (Q2830204) (← links)
- (Q3386623) (← links)
- CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS (Q3401474) (← links)
- HYBRID EXTENDED FINITE AUTOMATA (Q3503090) (← links)
- Deterministic Input-Reversal and Input-Revolving Finite Automata (Q3540102) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- Description of restricted automata by first-order formulae (Q4077997) (← links)
- (Q4122826) (← links)
- Observations about bounded languages and developmental systems (Q4128032) (← links)
- (Q4170259) (← links)
- The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
- A CUCH-machine: The automatic treatment of bound variables (Q4403722) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- Some restrictions onW-grammars (Q4776853) (← links)
- Tree-stack automata (Q4879207) (← links)
- (Q5019689) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Gaining Power by Input Operations: Finite Automata and Beyond (Q5200048) (← links)
- Diving into the queue (Q5223609) (← links)
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS (Q5247179) (← links)
- Decidability of code properties (Q5425746) (← links)
- (Q5446606) (← links)
- A note on undecidable properties of formal languages (Q5538917) (← links)
- Control sets on grammars (Q5539750) (← links)
- The theory of languages (Q5551468) (← links)
- Quasi-realtime languages (Q5582342) (← links)
- The theory of languages (Q5592247) (← links)
- Characterizations of transductions defined by abstract families of transducers (Q5626546) (← links)
- Multi-stack-counter languages (Q5637896) (← links)
- $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$ (Q5738989) (← links)
- On computational complexity of set automata (Q5918383) (← links)
- Visit-bounded stack automata (Q6056625) (← links)
- Self-verifying Cellular Automata (Q6108530) (← links)
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies (Q6114832) (← links)
- Rational weighted tree languages with storage (Q6647747) (← links)
