Affiliations: Center for Applied Cybernetics, Department of Computer Science, Technical University of Ostrava, 17. listopadu 15, Ostrava-Poruba, 708 33, Czech Republic. zdenek.sawa@vsb.cz
Note: [] Supported by the Czech Ministry of Education, Grant No. 1M0567, and the Czech Science Foundation – GACR, Grant No. P202/11/0340. Address for correspondence: Center for Applied Cybernetics, Department of Computer Science, Technical University of Ostrava, 17. listopadu 15, Ostrava-Poruba, 708 33, Czech Republic
Abstract: In languages over a unary alphabet, i.e., an alphabet with only one letter, words can be identified with their lengths. It is well known that each regular language over a unary alphabet can be represented as the union of a finite number of arithmetic progressions. Given a nondeterministic finite automaton (NFA) working over a unary alphabet (a unary NFA), the arithmetic progressions representing the language accepted by the automaton can be easily computed by the determinization of the given NFA. However, the number of the arithmetic progressions computed in this way can be exponential with respect to the size of the original automaton. Chrobak (1986) has shown that in fact O(n2) arithmetic progressions are sufficient for the representation of the language accepted by a unary NFA with n states, and Martinez (2002) has shown how these progressions can be computed in polynomial time. Recently, To (2009) has pointed out that Chrobak's construction and Martinez's algorithm, which is based on it, contain a subtle error and has shown how to correct this error. Geffert (2007) presented an alternative proof of Chrobak's result, also improving some of the bounds. In this paper, a new simpler and more efficient algorithm for the same problem is presented, using some ideas from Geffert (2007). The time complexity of the presented algorithm is O(n2(n + m)) and its space complexity is O(n + m), where n is the number of states and m the number of transitions of a given unary NFA.
