Stack languages and log n space
type: Item
instance of: scholarly article
title: Stack languages and log n space
zbMATH Open document ID: 0388.68070
DOI: 10.1016/0022-0000(78)90010-7
author: K. Appert
published in: Journal of Computer and System Sciences
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 3604383
MaRDI profile type: Publication
full work available at URL: 0022-0000(78)90010-7
OpenAlex ID: W2081819676
cites work: Nested Stack Automata
cites work: Translational lemmas, polynomial time, and \((\log n)^j\)-space
cites work: Quasi-realtime languages
cites work: Stack automata and compiling
cites work: One-way stack automata
cites work: Checking automata and one-way stack languages
cites work: Sets accepted by one-way stack automata are context sensitive
cites work: Q5592246
cites work: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
cites work: On two-way multihead automata
cites work: Language recognition by marking automata
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: On tape-bounded complexity classes and multihead finite automata
cites work: Q4125809
cites work: Rudimentary relations and stack languages
cites work: Deterministic stack automata and the quotient operator
description: scientific article; zbMATH DE number 3604383