Lower bounds on the size of sweeping automata
type: Item
instance of: scholarly article
title: Lower bounds on the size of sweeping automata
zbMATH Open document ID: 0445.68064
DOI: 10.1016/0022-0000(80)90034-3
author: Michael Sipser
published in: Journal of Computer and System Sciences
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3696531
zbMATH Keywords: deterministic two-way finite automaton
zbMATH Keywords: acception of languages
Wikidata QID: Q60019650
MaRDI profile type: Publication
full work available at URL: 0022-0000(80)90034-3
OpenAlex ID: W1990283467
cites work: Nondeterminism and the size of two way finite automata
cites work: Q4139689
cites work: Q4138187
cites work: Q4142699
cites work: Relationships between nondeterministic and deterministic tape complexities
description: scientific article; zbMATH DE number 3696531