Skip to main content
SpringerLink
Log in

A Quadratic Algorithm for Testing of Z-Codes

  • Conference paper
Book cover Intelligent Information and Database Systems (ACIIDS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7802))

Included in the following conference series:

  • 1933 Accesses

Abstract

We consider a subclass of circular codes, namely Z-codes for bi-infinite words, that have numerous interesting properties appeared in many problems of combinatorics on words. Our major concern is a very basic problem, which is to test whether a language of finite words is a Z-code. As the main result of this paper, we give an efficient algorithm running in a quadratic polynomial time for testing of Z-codes when they are regular.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J., Perrin, D., Reutenauer, C.: Codes and automata. Cambridge University Press (2010)

    Google Scholar 

  2. Carton, O., Perrin, D., Éric Pin, J.: Automata and semigroups recognizing infinite words. Logic and Automata 42, 133–168 (2008)

    Google Scholar 

  3. Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words. Acta Cybernetica 11(4), 241–256 (1994)

    MathSciNet  MATH  Google Scholar 

  4. Devolder, J., Timmerman, E.: Finitary codes for biinfinite words. Informatique Théorique et Applications 26(4), 363–386 (1992)

    MathSciNet  MATH  Google Scholar 

  5. Frey, G., Michel, C.J.: Circular codes in archaeal genomes. Journal of Theoretical Biology 223, 413–431 (2003)

    Article  MathSciNet  Google Scholar 

  6. Han, N.D., Huy, P.T., Thang, D.Q.: A Quadratic Algorithm for Testing of Omega-Codes. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ACIIDS 2012, Part I. LNCS, vol. 7196, pp. 338–347. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Lam, N.H., Van, D.L.: On a class of infinitary codes. Informatique théorique et Applications 24(5), 441–458 (1990)

    MATH  Google Scholar 

  8. Lam, N.H., Van, D.L.: On strict codes. Acta Cybernetica 10(1-2), 25–34 (1991)

    MathSciNet  MATH  Google Scholar 

  9. Madonia, M., Salemi, S., Sportelli, T.: A generalization of sardinas-patterson algorithm to \(\large{Z}\)-codes. Theoretical Computer Science 108, 251–270 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  10. Perrin, D., Éric Pin, J.: Infinite Words, automata, semigroups, logic and games. Elsevier Inc. (2004)

    Google Scholar 

  11. Van, D.L., Lam, N.H., Huy, P.T.: On codes concerning bi-infinite words. Acta Cybernetica 11(1-2), 97–109 (1993)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hung Yen University of Technology and Education, Vietnam

    Nguyen Dinh Han

  2. Nam Dinh University of Technology and Education, Vietnam

    Dang Quyet Thang

  3. Hanoi University of Science and Technology, Vietnam

    Phan Trung Huy

Authors
  1. Nguyen Dinh Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dang Quyet Thang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Phan Trung Huy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science and Information Systems, Department of Software Engineering, Universiti Teknologi Malaysia, 81310, Johar Baharu, Johor, Malaysia

    Ali Selamat  & Habibollah Haron  & 

  2. Institute of Informatics, Division of Knowledge Managements Systems, Wrocław University of Technology, Str. Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Ngoc Thanh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, N.D., Thang, D.Q., Huy, P.T. (2013). A Quadratic Algorithm for Testing of Z-Codes. In: Selamat, A., Nguyen, N.T., Haron, H. (eds) Intelligent Information and Database Systems. ACIIDS 2013. Lecture Notes in Computer Science(), vol 7802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36546-1_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36546-1_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36545-4

  • Online ISBN: 978-3-642-36546-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation