NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs-Reference-Cited by-同舟云学术

NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs

Published:2005-10 Issue:05 Volume:16 Page:883-896
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

DOMARATZKI MICHAEL¹,ELLUL KEITH²,SHALLIT JEFFREY²,WANG MING-WEI²

Affiliation:

1. Jodrey School of Computer Science, Acadia University, Wolfville, NS, B4P 2R6, Canada

2. School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

Abstract

In this paper we study some properties of cyclic unary regular languages. We find a connection between the uniqueness of the minimal NFA for certain cyclic unary regular languages and a Diophantine equation studied by Sylvester. We also obtain some results on the radius of unary languages. We show that the nondeterministic radius of a cyclic unary regular language L is not necessarily obtained by any of the minimal NFAs for L. We give a class of examples which demonstrates that the nondeterministic radius of a regular language cannot necessarily even be approximated by the minimal radius of its minimal NFAs.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054105003352

Reference14 articles.

1. On recursive solutions of a unit fraction equation

2. Perfect graphs and complex surface singularities with perfect local fundamental group

3. On the Number of Solutions of ∑sj = 1(1/xj) + 1/(x1 · · · xs) = 1

4. On the Diophantine equation 1 =∑1∕ni+ 1∕∏niand a class of homologically trivial complex surface singularities

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Separating the Classes of Recursively Enumerable Languages Based on Machine Size;International Journal of Foundations of Computer Science;2015-09

2. A Similarity Measure for Cyclic Unary Regular Languages;Fundamenta Informaticae;2009

3. Transition complexity of language operations;Theoretical Computer Science;2007-11

4. On the existence of prime decompositions;Theoretical Computer Science;2007-05

5. Prime Decompositions of Regular Languages;Developments in Language Theory;2006