Stack languages and log n space
From MaRDI portal
Cites work
- 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
- scientific article; zbMATH DE number 3551931 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Language recognition by marking automata
- Nested Stack Automata
- On tape-bounded complexity classes and multihead finite automata
- On two-way multihead automata
- One-way stack automata
- Quasi-real-time languages
- Relationships between nondeterministic and deterministic tape complexities
- Rudimentary relations and stack languages
- Sets accepted by one-way stack automata are context sensitive
- Stack automata and compiling
- Translational lemmas, polynomial time, and \((\log n)^j\)-space
Cited in
(4)
This page was built for publication: Stack languages and log n space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250712)