Nested Stack Automata
From MaRDI portal
Cited in
(53)- Abstract families of relations
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- Augmented transition networks and their relation to tree transducers
- Stack languages and log n space
- Decidability of EDT0L structural equivalence
- Measuring the expressive power of practical regular expressions by classical stacking automata models
- Macro tree transducers
- Some restrictions onW-grammars
- Theory of formal grammars
- The grammar of mammalian brain capacity
- On the complexity of finite, pushdown, and stack automata
- Diving into the queue
- Basic tree transducers
- Look-ahead on pushdowns
- The equivalence problem for real-time deterministic pushdown automata
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
- A new pumping lemma for indexed languages, with an application to infinite words
- Extended macro grammars and stack controlled machines
- Pushdown machines for the macro tree transducer
- Generators of regular languages
- A generalized approach to formal languages
- Iterated stack automata and complexity classes
- On the rational subset problem for groups.
- Grammatical characterizations of NPDAs and VPDAs with counters
- Two-way nested stack automata are equivalent to two-way stack automata
- Stochastic grammars and languages
- Tree-stack automata
- Die mit Nestedstackautomaten Berechenbaren Funktionen sind Elementar
- Regular sets over extended tree structures
- Tree pushdown automata
- Iterated pushdown automata and sequences of rational numbers
- Groups with context-free conjugacy problems.
- Weighted automata with storage
- The calculi of emergence: Computation, dynamics and induction
- GROUPS WITH INDEXED CO-WORD PROBLEM
- An Automata Characterisation for Multiple Context-Free Languages
- Rational weighted tree languages with storage
- Principal abstract families of weighted tree languages
- Pushdown tree automata
- Hierarchies of hyper-AFLs
- An implementation of syntax directed functional programming on nested- stack machines
- EDT0L grammars with only one variable have tractable generating functions
- Queues, stacks, and transcendentality at the transition to chaos
- On the existence of generators for certain AFL
- Principal AFL
- Gaining Power by Input Operations: Finite Automata and Beyond
- Queue Automata: Foundations and Developments
- Model-checking games for typed -calculi
- A shrinking lemma for indexed languages
- Abstract interpretation of indexed grammars
- Multidimensional trees
- COMBING NILPOTENT AND POLYCYCLIC GROUPS
This page was built for publication: Nested Stack Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576259)
