Skip to main content
SpringerLink
Log in

Finite Automata, Palindromes, Powers, and Patterns

  • Conference paper
Language and Automata Theory and Applications (LATA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5196))

Abstract

Given a language L and a nondeterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider how long the shortest word can be. The languages L that we examine include the palindromes, the non-palindromes, the k-powers, the non-k-powers, the powers, the non-powers (also called primitive words), and words matching a general pattern.

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. Ackerman, M., Shallit, J.: Efficient enumeration of regular languages. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 226–242. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Anderson, T., Rampersad, N., Santean, N., Shallit, J.: Finite automata, palindromes, patterns, and borders, http://www.arxiv.org/abs/0711.3183

  3. Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Castiglione, G., Restivo, A., Salemi, S.: Patterns in words and languages. Disc. Appl. Math. 144, 237–246 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986); Errata 302, 497–498 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dömösi, P., Horváth, G., Ito, M.: A small hierarchy of languages consisting of non-primitive words. Publ. Math (Debrecen) 64, 261–267 (2004)

    MATH  MathSciNet  Google Scholar 

  7. Garey, M., Johnson, D.: Computers and Intractability. Freeman, New York (1979)

    MATH  Google Scholar 

  8. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75–77 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Heath-Brown, D.R.: Zero-free regions for Dirichlet L-functions, and the least prime in an arithmetic progression. Proc. Lond. Math. Soc. 64, 265–338 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  11. Horváth, S., Karhumäki, J., Kleijn, J.: Results concerning palindromicity. J. Inf. Process. Cybern. EIK 23, 441–451 (1987)

    MATH  Google Scholar 

  12. Ito, M., Katsura, M., Shyr, H.J., Yu, S.S.: Automata accepting primitive words. Semigroup Forum 37, 45–52 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Knuth, D., Morris Jr., J., Pratt, V.: Fast pattern matching in strings. SIAM J. Computing 6, 323–350 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kunze, M., Shyr, H.J., Thierrin, G.: h-bounded and semi-discrete languages. Information and Control 51, 147–187 (1981)

    Article  MathSciNet  Google Scholar 

  15. Lyndon, R.C., Schützenberger, M.-P.: The equation a m = b n c p in a free group. Michigan Math. J. 9, 289–298 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  16. Mäkinen, E.: On lexicographic enumeration of regular and context-free languages. Acta Cybernetica 13, 55–61 (1997)

    MATH  MathSciNet  Google Scholar 

  17. Martinez, A.: Efficient computation of regular expressions from unary NFAs. In: DCFS 2002, pp. 174–187 (2002)

    Google Scholar 

  18. Pritchard, P.: Linear prime-number sieves: a family tree. Sci. Comput. Programming 9, 17–35 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pǎun, G., Salomaa, A.: Thin and slender languages. Disc. Appl. Math. 61, 257–270 (1995)

    Article  Google Scholar 

  20. Restivo, A., Salemi, S.: Words and patterns. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 215–218. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Rosaz, L.: Puzzle corner, #50. Bull. European Assoc. Theor. Comput. Sci. 76, 234 (February 2002); Solution 77, 261 (June 2002)

    Google Scholar 

  22. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Berlin (1997)

    MATH  Google Scholar 

  23. Savitch, W.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. System Sci. 4, 177–192 (1970)

    MATH  MathSciNet  Google Scholar 

  24. Shallit, J.: Numeration systems, linear recurrences, and regular sets. Inform. Comput. 113, 331–347 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  25. Shallit, J., Breitbart, Y.: Automaticity I: Properties of a measure of descriptional complexity. J. Comput. System Sci. 53, 10–25 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  26. Yu, S.: Regular languages. In: Handbook of Formal Languages, Ch. 2, pp. 41–110 (1997)

    Google Scholar 

  27. Zhang, G.-Q.: Automata, Boolean matrices, and ultimate periodicity. Inform. Comput. 152, 138–154 (1999)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    Terry Anderson, Narad Rampersad, Nicolae Santean & Jeffrey Shallit

Authors
  1. Terry Anderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Narad Rampersad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolae Santean
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jeffrey Shallit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anderson, T., Rampersad, N., Santean, N., Shallit, J. (2008). Finite Automata, Palindromes, Powers, and Patterns. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88282-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88281-7

  • Online ISBN: 978-3-540-88282-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation