Skip to main content
SpringerLink
Log in

On the Number of Closed Factors in a Word

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

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

G. Fici—Partially supported by Italian MIUR Project PRIN 2010LYA9RH, “Automi e Linguaggi Formali: Aspetti Matematici e Applicativi”.

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. Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C.S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed factorization. In: Proceedings of the Prague Stringology Conference 2014, pp. 162–168 (2014)

    Google Scholar 

  2. Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Internat. J. Found. Comput. Sci. 15, 293–306 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bucci, M., De Luca, A., Fici, G.: Enumeration and Structure of Trapezoidal Words. Theoret. Comput. Sci. 468, 12–22 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bucci, M., De Luca, A., Glen, A., Zamboni, L.: A new characteristic property of rich words. Theoretical Computer Science 410(30), 2860–2863 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bucci, M., de Luca, A., De Luca, A.: Rich and periodic-like words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 145–155. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Carpi, A., de Luca, A.: Periodic-like words, periodicity and boxes. Acta Inform. 37, 597–618 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. De Luca, A., Fici, G.: Open and closed prefixes of sturmian words. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 132–142. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. 255(1–2), 539–553 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fici, G.: A classification of trapezoidal words. In: WORDS 2011, 8th International Conference on Words. Electronic Proceedings in Theoretical Computer Science, vol. 63, pp. 129–137 (2011)

    Google Scholar 

  10. Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. European J. Combin. 30, 510–531 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  11. Peltomäki, J.: Introducing privileged words: Privileged complexity of Sturmian words. Theoret. Comput. Sci. 500, 57–67 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  12. Restivo, A., Rosone, G.: Burrows-Wheeler transform and palindromic richness. Theoret. Comput. Sci. 410(30), 3018–3026 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. Available electronically at http://oeis.org, Sequence A226452: Number of closed binary words of length \(n\)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Sheffield, Sheffield, UK

    Golnaz Badkobeh

  2. Dipartimento di Matematica e Informatica, Università di Palermo, Palermo, Italy

    Gabriele Fici

  3. Dipartimento di Informatica, Università di Verona, Verona, Italy

    Zsuzsanna Lipták

Authors
  1. Golnaz Badkobeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriele Fici
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zsuzsanna Lipták
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gabriele Fici .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Badkobeh, G., Fici, G., Lipták, Z. (2015). On the Number of Closed Factors in a Word. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation