Abstract
In this paper, we propose an algorithm to decide whether a regular language recognized by finite automata is a Z-code or not. This algorithm has time complexity O(n 4) for the general case of non-deterministic automata, O(n 2) for the restricted case of deterministic automata, where n is the number of states of finite automata.
This work is supported by Vietnamese National Foundation for Science & Technology Development (NAFOSTED).
Chapter PDF
Similar content being viewed by others
References
Berstel, J., Perrin, D.: 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)
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. PhD thesis, Humboldt University, Berlin (1985)
Mohri, M., Pereira, F., Riley, M.: Speech recognition with weighted finite-state transducers. Springer, Heidelberg (2007)
Devolder, J., Timmerman, E.: Finitary codes for biinfinite words. Informatique Théorique et Applications 26(4), 363–386 (1992)
Van, D.L., Lam, N.H., Huy, P.T.: On codes concerning bi-infinite words. Acta Cybernetica 11(1-2), 97–109 (1993)
Lam, N.H., Van, D.L.: On a class of infinitary codes. Theoretical Infomatics and Applications 24, 441–458 (1990)
Madonia, M., Salemi, S., Sportelli, T.: A generalization of Sardinas-Patterson algorithm to Z-codes. Theoretical Computer Science 108, 251–270 (1993)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press and McGraw-Hill (2009)
Van, D.L., Thomas, D.G., Subramanian, K.G., Siromoney, R.: Bi-Infinitary Codes. RAIRO Inform. Theor. Appl. 24(1), 67–87 (1990)
Restivo, A.: Codes and Automata. In: Pin, J.E. (ed.) LITP 1988. LNCS, vol. 386, Springer, Heidelberg (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Thang, D.Q., Han, N.D., Huy, P.T. (2012). Algorithms Based on Finite Automata for Testing of Z-codes. In: Park, J.J., Zomaya, A., Yeo, SS., Sahni, S. (eds) Network and Parallel Computing. NPC 2012. Lecture Notes in Computer Science, vol 7513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35606-3_74
Download citation
DOI: https://doi.org/10.1007/978-3-642-35606-3_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35605-6
Online ISBN: 978-3-642-35606-3
eBook Packages: Computer ScienceComputer Science (R0)