A relation between space, return and dual return complexities
type: Item
instance of: scholarly article
title: A relation between space, return and dual return complexities
zbMATH Open document ID: 0409.68026
DOI: 10.1016/0304-3975(79)90010-0
author: Gerd Wechsung
author: Andreas Brandstädt
published in: Theoretical Computer Science
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3637283
zbMATH Keywords: Return Complexity
zbMATH Keywords: Space Complexity of Nondeterministic Turing Machines
zbMATH Keywords: Languages Recognized
MaRDI profile type: Publication
full work available at URL: 0304-3975(79)90010-0
OpenAlex ID: W2033229895
cites work: Q4164823
cites work: Q4107932
cites work: Q4151731
cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
cites work: Writing stack acceptors
cites work: A generalization of context-free determinism
cites work: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
cites work: Q4134977
cites work: Q4116063
description: scientific article; zbMATH DE number 3637283