Checking automata and one-way stack languages
From MaRDI portal
Cites work
- Deterministic stack automata and the quotient operator
- scientific article; zbMATH DE number 3483582 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Indexed Grammars—An Extension of Context-Free Grammars
- One-way stack automata
- Stack automata and compiling
Cited in
(63)- Hierarchies of hyper-AFLs
- Extended macro grammars and stack controlled machines
- On pebble automata
- Representations of language families by homomorphic equality operations and generalized equality sets
- Tree transducers, L systems, and two-way machines
- 2DST mappings of languages and related problems
- Iterated stack automata and complexity classes
- Two-way A-transducers and AFL
- Uniformly erasable AFL
- Bounded AFLs
- Characterization theorems on abstract families of transducers
- Proving containment of bounded AFL
- Control sets on context-free grammar forms
- On the complexity of formal grammars
- One way finite visit automata
- On two-way sequential transductions of full semi-AFL's
- Stack languages and log n space
- Some decision problems concerning sequential transducers and checking automata
- Transducers and the decidability of independence in free monoids
- The power of two-way deterministic checking stack automata
- Theory of formal grammars
- Some decision problems concerning semilinearity and commutation.
- Alternating and empty alternating auxiliary stack automata.
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
- Decision problems and projection languages for restricted variants of two-dimensional automata
- Visit-bounded stack automata
- Weighted automata with storage
- On families of full trios containing counter machine languages
- On counting functions and slenderness of languages
- Deep pushdown automata
- Principal AFL
- Finite-turn checking automata
- Substitution and bounded languages
- Absolutely parallel grammars and two-way finite-state transducers
- On AFL generators for finitely encoded AFA
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Uniform simulations of nondeterministic real time multitape turing machines
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
- Compelled operations and operations of degreeP
- scientific article; zbMATH DE number 3776895 (Why is no real title available?)
- scientific article; zbMATH DE number 3548457 (Why is no real title available?)
- On languages with a certain prefix property
- Comparing language operations
- scientific article; zbMATH DE number 3602690 (Why is no real title available?)
- The complexity of the membership problem for some extensions of context-free languagest†
- Outils et résultats pour les transducteurs boustrophédons
- Tree-stack automata
- Space complexity of stack automata models
- Automata with two-sided pushdowns defined over free groups generated by reduced alphabets
- Chains of full AFL's
- Basic tree transducers
- Familles de langages fermées par crochet ouvert
- Visit-bounded stack automata
- Tree-walking-storage automata
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies
- Space Complexity of Stack Automata Models
- Deterministic tree-walking-storage automata
- Relativized codes, finite decodability, and bounded languages
- Deterministic real-time tree-walking-storage automata
- Deterministic real-time tree-walking-storage automata
- Techniques for showing the decidability of the boundedness problem of language acceptors
- Syntactic operators on full semiAFLs
This page was built for publication: Checking automata and one-way stack languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2532393)
