Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata

• Autorzy: Sawa Z.
• Języki publikacji: EN

Abstrakty

EN

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(n²) 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(n²(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.

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2013
• Tom: Vol. 123, nr 1
• Strony: 97--106
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Sawa Z.

• Center for Applied Cybernetics, Department of Computer Science Technical University of Ostrava 17. listopadu 15, Ostrava-Poruba, 708 33, Czech Republic

Bibliografia

• [1] Chrobak, M.: Finite Automata and Unary Languages, Theoretical Computer Science, 47(2), 1986, 149–158.
• [2] Chrobak, M.: Errata to: “Finite Automata and Unary Languages” [Theoret. Comput. Sci. 47 (1986) 149–158], Theoretical Computer Science, 302(1-3), 2003, 497–498.
• [3] Geffert, V.: Magic numbers in the state hierarchy of finite automata, Information and Computation, 205(11), 2007, 1652–1670.
• [4] Göller, S., Mayr, R., To, A. W.: On the Computational Complexity of Verifying One-Counter Processes, LICS’09, IEEE Computer Society, 2009.
• [5] Gruber, H., Holzer, M.: Computational Complexity of NFA Minimization for Finite and Unary Languages, LATA’08, LNCS 5196, Springer, 2008.
• [6] Kozen, D. C.: Automata and Computability, Springer-Verlag, 1997.
• [7] Martinez, A.: Efficient Computation of Regular Expressions from Unary NFAs, Descriptional Complexity of Formal Systems (DFCS), 2002.
• [8] Martinez, A.: Topics in Formal Languages: String Enumeration, Unary NFAs and State Complexity, Master Thesis, University of Waterloo, 2002.
• [9] Parikh, R. J.: On context-free languages, Journal of the ACM, 13(4), 1966, 570–581.
• [10] Sawa, Z.: Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA, 4th International Workshop on Reachability Problems (RP 2010), LNCS 6227, Springer, 2010.
• [11] Tarjan, R.: Depth-First Search and Linear Graph Algorithms, SIAM Journal of Computing, 1(2), June 1972, 146–160.
• [12] To, A. W.: Unary finite automata vs. arithmetic progressions, Information Processing Letterss, 109(17), 2009, 1010–1014.