On tape bounds for single letter alphabet language processing
type: Item
instance of: scholarly article
title: On tape bounds for single letter alphabet language processing
zbMATH Open document ID: 0351.68014
DOI: 10.1016/0304-3975(76)90024-4
author: K. Appert
published in: Theoretical Computer Science
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3546711
MaRDI profile type: Publication
full work available at URL: 0304-3975(76)90024-4
OpenAlex ID: W2091565038
cites work: Space bounds for processing contentless inputs
cites work: Two memory bounds for the recognition of primes by automata
cites work: Some Results on Tape-Bounded Turing Machines
cites work: Q5592246
cites work: Q4140386
description: scientific article; zbMATH DE number 3546711