Stack automata and compiling

Cited in

(51)

Abstract families of relations
Stack languages and log n space
Measuring the expressive power of practical regular expressions by classical stacking automata models
Relating refined space complexity classes
Deterministic real-time tree-walking-storage automata
Characterizations of pushdown machines in terms of time-bounded computers
Theory of formal grammars
Leftmost derivations in CD grammar systems
On AFL generators for finitely encoded AFA
Writing stack acceptors
On the complexity of decision problems for some classes of machines and applications
Diving into the queue
scientific article; zbMATH DE number 3548457 (Why is no real title available?)
Nonerasing stack automata
On the complexity of decision problems for counter machines with applications to coding theory
On the extension of Gladkij's theorem and the hierarchies of languages
(Semi)alternating stack automata
Sweeping input-driven pushdown automata
Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
Deterministic stack transducers
On termination problems for finitely interpreted ALGOL-like programs
Tree-walking-storage automata
Deterministic tree-walking-storage automata
Visit-bounded stack automata
Tree-stack automata
On store languages of language acceptors
Visit-bounded stack automata
Deterministic stack transducers
Similarity in languages and programs
On procedures as open subroutines. II
Deterministic stack automata and the quotient operator
Reachability analysis of pushdown systems with an upper stack
The formal termination problem for programs with finite ALGOL 68-modes
What is the most natural generalized pumping lemma beyond regular and context-free languages?
Yield-languages of two-way pushdown tree automata
A Note on Pushdown Store Automata and Regular Systems
Checking automata and one-way stack languages
Über die mit Stackautomaten berechenbaren Funktionen
On the existence of generators for certain AFL
Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-k storage automata
Degree-languages: A new concept of acceptance
Queue Automata: Foundations and Developments
Generalizations of Checking Stack Automata: Characterizations and Hierarchies
Jede mit Stackautomaten berechenbare Funktion ist elementar
1-way stack automaton with jumps
Stackautomaten in Labyrinthen
Abstract families of length-preserving processors
Some definitional suggestions for automata theory
Characterization theorems on abstract families of transducers
Deterministic real-time tree-walking-storage automata
Writing pushdown acceptors

This page was built for publication: Stack automata and compiling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5532541)