Space complexity of stack automata models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 5593330 (Why is no real title available?)
- scientific article; zbMATH DE number 3302285 (Why is no real title available?)
- Checking automata and one-way stack languages
- Deterministic stack transducers
- Generalizations of checking stack automata: characterizations and hierarchies
- On store languages of language acceptors
- Pushdown automata and constant height: decidability and bounds
- Sets accepted by one-way stack automata are context sensitive
- Stack languages and log n space
- The power of two-way deterministic checking stack automata
- Visibly pushdown languages
Cited in
(5)
This page was built for publication: Space complexity of stack automata models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041255)