Abstract
We consider a special class of codes, namely ω-codes related to infinite word which had been studied by many authors. Until now, the best algorithm to test whether a regular language X is an ω-code has time complexity \({\cal O}(n^3)\), where n is the size of the transition monoid of the minimal automaton recognizing X. In this paper, with any monoid M saturating X (the transition monoid above is only a special case), we propose a new test and establish a quadratic testing algorithm with time complexity \({\cal O}(n^2)\) to verify if X is an ω-code, where n is Card(M).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Augros, X., Litovsky, I.: Algorithm to test rational ω-codes. In: Proceedings of the Conference of The Mathematical Foundation of Informatics, pp. 23–37. World Scientific (October 1999)
Berman, K.A., Paul, J.L.: Algorithms - Sequential, parallel, and distributed. Thomson Learning, Inc., USA (2005)
Berstel, J., Perrin, D., Reutenauer, C.: Theory of Codes. Academic Press Inc., New York (1985)
Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words. Acta Cybernetica 11(4), 241–256 (1994)
Lallement, G.: Semigroups and Combinational Applications. John Wiley and Sons, Inc. (1979)
Lam, N.H., Van, D.L.: On strict codes. Acta Cybernetica 10(1-2), 25–34 (1991)
Mateescu, A., Mateescu, G.D., Rozenberg, G., Salomaa, A.: Shuffle-like operations on ω-words. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 395–411. Springer, Heidelberg (1997)
Sedgewick, R.: Algorithms in C++, Part 5: Graph algorithms. Addition-Wesley, Pearson Education, Inc., USA (2002)
Staiger, L.: On infinitary finite length codes. Informatique Théorique et Applications 20(4), 483–494 (1986)
Van, D.L.: Contribution to Combinatorics on Words. Ph.D. thesis, Humboldt University, Berlin (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, N.D., Huy, P.T., Thang, D.Q. (2012). A Quadratic Algorithm for Testing of Omega-Codes. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28487-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-28487-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28486-1
Online ISBN: 978-3-642-28487-8
eBook Packages: Computer ScienceComputer Science (R0)