Some results on the structure of unary unambiguous automata
type: Item
instance of: scholarly article
title: Some results on the structure of unary unambiguous automata
zbMATH Open document ID: 1223.68062
author: Marcella Anselmo
author: Maria Madonia
published in: Advances in Applied Mathematics
publication date: 2011-06-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5907654
zbMATH Keywords: finite automata
zbMATH Keywords: ambiguity
zbMATH Keywords: unary alphabet
zbMATH Keywords: deterministic finite automaton (DFA)
zbMATH Keywords: unambiguous finite automaton (UNFA)
MaRDI profile type: Publication
full work available at URL: j.aam.2010.05.003
OpenAlex ID: W1969025852
cites work: Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata
cites work: Q4506483
cites work: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
cites work: THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
cites work: Minimal NFA Problems are Hard
cites work: Q5585020
cites work: A special case of a unary regular language containment
cites work: Complementing unary nondeterministic automata
cites work: Roots of unity and covering sets
cites work: Q5614072
DOI: 10.1016/J.AAM.2010.05.003
description: scientific article; zbMATH DE number 5907654