Deterministic tree-walking-storage automata
From MaRDI portal
Cites work
- (Semi)alternating stack automata
- 1-way stack automaton with jumps
- A generalization of context-free determinism
- A Grammatical Characterization of One-Way Nondeterministic Stack Languages
- An Automata Characterisation for Multiple Context-Free Languages
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- Checking automata and one-way stack languages
- Deterministic stack automata and the quotient operator
- Deterministic stack transducers
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies
- scientific article; zbMATH DE number 3936518 (Why is no real title available?)
- scientific article; zbMATH DE number 3461491 (Why is no real title available?)
- scientific article; zbMATH DE number 5790353 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- Intercalation theorems for stack languages
- Limited automata and context-free languages
- Limited automata and regular languages
- Nonerasing stack automata
- On simulation cost of unary limited automata
- One way finite visit automata
- One-way stack automata
- Pushdown tree automata
- Reversible limited automata
- Sets accepted by one-way stack automata are context sensitive
- Space Complexity of Stack Automata Models
- Stack automata and compiling
- Tinput-driven pushdown, counter, and stack automata
- Translations on a context free grammar
- Tree-stack automata
- Tree-walking automata cannot be determinized
- Tree-Walking Automata Do Not Recognize All Regular Languages
- Tree-walking-storage automata
- Variations of checking stack automata: obtaining unexpected decidability properties
This page was built for publication: Deterministic tree-walking-storage automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844155)
