Two-way deterministic finite automata are exponentially more succinct than sweeping automata
type: Item
instance of: scholarly article
title: Two-way deterministic finite automata are exponentially more succinct than sweeping automata
zbMATH Open document ID: 0471.68039
DOI: 10.1016/0020-0190(81)90012-0
author: Silvio Micali
published in: Information Processing Letters
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3738926
zbMATH Keywords: complexity
zbMATH Keywords: size of description
zbMATH Keywords: nondeterminism
MaRDI profile type: Publication
full work available at URL: 0020-0190(81)90012-0
OpenAlex ID: W2085151919
cites work: Nondeterminism and the size of two way finite automata
cites work: Q3938525
description: scientific article; zbMATH DE number 3738926