Halting space-bounded computations
type: Item
instance of: scholarly article
title: Halting space-bounded computations
zbMATH Open document ID: 0423.68011
DOI: 10.1016/0304-3975(80)90053-5
author: Michael Sipser
published in: Theoretical Computer Science
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3658970
zbMATH Keywords: halting space-bounded computations
zbMATH Keywords: deterministic Turing machine
zbMATH Keywords: two-way finite automata
zbMATH Keywords: deterministic computation
zbMATH Keywords: two-way multihead finite automata
MaRDI profile type: Publication
full work available at URL: 0304-3975(80)90053-5
OpenAlex ID: W1975698236
cites work: On tape bounds for single letter alphabet language processing
cites work: Some Results on Tape-Bounded Turing Machines
cites work: Q5592246
cites work: On two-way multihead automata
cites work: Transformational methods and their application to complexity problems
cites work: Transformational methods and their application to complexity problems. Corrigenda
cites work: Nondeterminism and the size of two way finite automata
cites work: Q5636862
description: scientific article; zbMATH DE number 3658970