Unary finite automata vs. arithmetic progressions

Information Processing Letters

Volumn 109, Issue 17, 2009, Pages 1010-1014

  To, Anthony Widjaja ^a  

^a Institute for Neural Computation   (United Kingdom)

Author keywords

Algorithms; Arithmetic progressions; Formal languages; Unary languages

Indexed keywords

ARITHMETIC PROGRESSIONS; POLYNOMIAL-TIME ALGORITHMS; UNARY LANGUAGES;

ALGORITHMS; FORMAL LANGUAGES; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

LINGUISTICS;

EID: 67650220887     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.06.005     Document Type: Article

References (12)

1. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley
2. T. Anderson, N. Rampersad, N. Santean, J. Shallit, Finite automata, palindromes, powers, and patters, in: LATA 2008, pp. 52-63
3. Brauer A. On a problem of partitions. Amer. J. Math. 64 (1942) 299-312
4. Chrobak M. Finite automata and unary languages. Theoret. Comput. Sci. 47 (1986) 149-158 Errata
5. Chrobak M. Finite automata and unary languages. Theoret. Comput. Sci. 302 (2003) 497-498
6. H. Gruber, M. Holzer, Computational complexity of NFA minimization for finite and unary languages, in: LATA 2008, pp. 261-272
7. Kozen D. Automata and Computability (1997), Springer-Verlag
8. Litow B. A special case of a unary regular language containment. Theory Comput. Syst. 39 (2006) 743-751
9. Liubicz U.I. Bounds for the optimal determinization of nondeterministic autonomic automata. Sibirskii Matemat. Journal 2 (1964) 337-355 (in Russian)
10. A. Martinez, Efficient computation of regular expressions from unary NFAs, in: DFCS 2002, pp. 174-187
11. A. Martinez, Topics in formal languages: String enumeration, unary NFAs and state complexity. Master thesis, Faculty of Mathematics, Univ. of Waterloo, 2002
12. J. Shallit, The Frobenius problem and its generalization, in: DLT 2008, pp. 72-83