Tree-walking-storage automata
From MaRDI portal
Publication:6088945
DOI10.1007/978-3-031-33264-7_15OpenAlexW4377081428MaRDI QIDQ6088945
Publication date: 16 November 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33264-7_15
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tree-walking automata cannot be determinized
- 1-way stack automaton with jumps
- Nonerasing stack automata
- Deterministic stack automata and the quotient operator
- Checking automata and one-way stack languages
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- An Automata Characterisation for Multiple Context-Free Languages
- Pushdown tree automata
- Tree-Walking Automata Do Not Recognize All Regular Languages
- (Semi)alternating stack automata
- Tinput-Driven Pushdown, Counter, and Stack Automata
- Deterministic Stack Transducers
- Tree-stack automata
- Intercalation theorems for stack languages
- Stack automata and compiling
- One-way stack automata
- Sets accepted by one-way stack automata are context sensitive
- Translations on a context free grammar
- Variations of checking stack automata: obtaining unexpected decidability properties
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies
- Space Complexity of Stack Automata Models
This page was built for publication: Tree-walking-storage automata
