Converting two-way nondeterministic unary automata into simpler automata.
type: Item
instance of: scholarly article
title: Converting two-way nondeterministic unary automata into simpler automata.
zbMATH Open document ID: 1045.68080
DOI: 10.1016/S0304-3975(02)00403-6
author: Viliam Geffert
author: Carlo Mereghetti
author: Giovanni Pighizzini
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1965273
zbMATH Keywords: Formal languages
zbMATH Keywords: Finite state automata
zbMATH Keywords: Unary languages
Wikidata QID: Q57380802
MaRDI profile type: Publication
cites work: Q3938525
cites work: Q4139689
cites work: Two-way automaton computations
cites work: Finite automata and unary languages
cites work: Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
cites work: Q3862379
cites work: Q4503152
cites work: Optimal simulations between unary automata
cites work: Two-way deterministic finite automata are exponentially more succinct than sweeping automata
cites work: Q4779176
cites work: Nondeterminism and the size of two way finite automata
cites work: Lower bounds on the size of sweeping automata
cites work: A note on the reduction of two-way automata to one-way automata
description: scientific article; zbMATH DE number 1965273