NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs

DOI10.1142/S0129054105003352zbMath1080.68052WikidataQ56504610 ScholiaQ56504610MaRDI QIDQ5704371

Wang, Ming-wei, Keith Ellul, Michael Domaratzki, Jeffrey O. Shallit

Publication date: 14 November 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

nondeterministic finite automatacyclic unary regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Separating the Classes of Recursively Enumerable Languages Based on Machine Size ⋮ On the existence of prime decompositions ⋮ Transition complexity of language operations

Cites Work

• Unnamed Item
• Perfect graphs and complex surface singularities with perfect local fundamental group
• Finite automata and unary languages
• On the number of solutions of \({\sum _{j=1}^ s}(1/x_ j)+1/(x_ 1{\cdots}x_ s)=1\)
• On the diophantine equation \(1=\sum \frac{1}{n_ i}+\frac{1}{\prod n_ i}\quad and\) a class of homologically trivial complex surface singularities
• THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
• On the equation $\sum_{p|N}\frac1p+\frac1N = 1$, pseudoperfect numbers, and perfectly weighted graphs
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
• On distinct unit fractions whose sum equals 1

This page was built for publication: NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs