One-way stack automata
From MaRDI portal
Cited in
(96)- On input-revolving deterministic and nondeterministic finite automata
- Remarks on multihead pushdown automata and multihead stack automata
- A homomorphic characterization of recursively enumerable languages
- Extended macro grammars and stack controlled machines
- Grammars, derivation modes and properties of indexed and type-0 languages
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time
- A grammatical characterization of alternating pushdown automata
- Superdeterministic DPDAs: The method of accepting does affect decision problems
- One-way weak-stack-counter automata
- A note on decision problems for three-way two-dimensional finite automata
- Iterated stack automata and complexity classes
- 1-way stack automaton with jumps
- Reversal-bounded multipushdown machines
- Characterization theorems on abstract families of transducers
- Finite automata with multiplication
- Degree-languages: A new concept of acceptance
- Control sets on context-free grammar forms
- Stack languages and log n space
- A note on cyclic closure operations
- Some decision problems concerning sequential transducers and checking automata
- Monadic recursion schemes: The effect of constants
- Pushdown cellular automata
- Petri net algorithms in the theory of matrix grammars
- Somewhat finite approaches to infinite sentences.
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
- A note on self-modifying finite automata
- Homomorphic characterizations of recursively enumerable languages with very small language classes
- Accepting runs in a two-way finite automaton
- On store languages of language acceptors
- Context free normal systems and ETOL systems
- Theory of formal grammars
- Alternating and empty alternating auxiliary stack automata.
- Principal abstract families of weighted tree languages
- Visit-bounded stack automata
- Removing nondeterminism in constant height pushdown automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- On store languages and applications
- Deep pushdown automata
- Deterministic stack automata and the quotient operator
- Checking automata and one-way stack languages
- Scattered context grammars
- What makes some language theory problems undecidable
- Finite-turn checking automata
- Absolutely parallel grammars and two-way finite-state transducers
- On the extension of Gladkij's theorem and the hierarchies of languages
- Sublogarithmic ambiguity
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-k storage automata
- Set automata
- Deterministic stack transducers
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Context-free grammars with linked nonterminals
- HYBRID EXTENDED FINITE AUTOMATA
- Deterministic Input-Reversal and Input-Revolving Finite Automata
- Uniform simulations of nondeterministic real time multitape turing machines
- Description of restricted automata by first-order formulae
- scientific article; zbMATH DE number 3548457 (Why is no real title available?)
- Observations about bounded languages and developmental systems
- scientific article; zbMATH DE number 3604381 (Why is no real title available?)
- The complexity of the membership problem for some extensions of context-free languagest†
- A CUCH-machine: The automatic treatment of bound variables
- Deterministic stack transducers
- Some restrictions onW-grammars
- Tree-stack automata
- Products in a category with only one object
- Queue Automata: Foundations and Developments
- Further remarks on DNA overlap assembly
- Gaining Power by Input Operations: Finite Automata and Beyond
- Diving into the queue
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
- Decidability of code properties
- Automata with two-sided pushdowns defined over free groups generated by reduced alphabets
- A note on undecidable properties of formal languages
- Control sets on grammars
- The theory of languages
- Quasi-realtime languages
- The theory of languages
- Characterizations of transductions defined by abstract families of transducers
- Multi-stack-counter languages
- \(\mathbb {N}\)-memory automata over the alphabet \(\mathbb {N}\)
- On computational complexity of set automata
- Familles de langages fermées par crochet ouvert
- Visit-bounded stack automata
- Tree-walking-storage automata
- Self-verifying Cellular Automata
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies
- Rational weighted tree languages with storage
- Deterministic tree-walking-storage automata
- Cayley automata
- What is the most natural generalized pumping lemma beyond regular and context-free languages?
- Deterministic real-time tree-walking-storage automata
- Measuring the expressive power of practical regular expressions by classical stacking automata models
- Deterministic real-time tree-walking-storage automata
- Leftmost derivations in CD grammar systems
- Store languages of Turing machines and counter machines
- Syntactic operators on full semiAFLs
This page was built for publication: One-way stack automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5557460)
