Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algebraic Informatics

CAI 2009: Algebraic Informatics pp 250–259Cite as

Combinatorics of Finite Words and Suffix Automata

  • Conference paper

  • 432 Accesses

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

Abstract

The suffix automaton of a finite word is the minimal deterministic automaton accepting the language of its suffixes. The states of the suffix automaton are the classes of an equivalence relation defined on the set of factors. We explore the relationship between the combinatorial properties of a finite word and the structural properties of its suffix automaton. We give formulas for expressing the total number of states and the total number of edges of the suffix automaton in terms of special factors of the word.

Partially supported by the MIUR Project “Aspetti matematici e applicazioni emergenti degli automi e dei linguaggi formali” (2007).

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40, 31–55 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Crochemore, M.: Transducers and repetitions. Theor. Comput. Sci. 45(1), 63–86 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Linear Modeling: Background and Application, vol. 2, ch. 9, pp. 399–462. Springer, Berlin (1997)

    Chapter  Google Scholar 

  4. de Luca, A.: On the combinatorics of finite words. Theor. Comput. Sci. 218, 13–39 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fici, G., Mignosi, F., Restivo, A., Sciortino, M.: Word assembly through minimal forbidden words. Theor. Comput. Sci. 359(1), 214–230 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications. Cambridge Univ. Press, New York (2002)

    Book  MATH  Google Scholar 

  7. De Luca, A.: Private communication (2009)

    Google Scholar 

  8. De Luca, A., Bucci, M., de Luca, A., Zamboni, L.Q.: On different generalizations of episturmian words. Theor. Comput. Sci. 393, 23–36 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Mignosi, F., Restivo, A., Sciortino, M.: Forbidden Factors and Fragment Assembly. RAIRO Theoret. Inform. Appl. 35(6), 565–577 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Raffinot, M.: Asymptotic estimation of the average number of terminal states in dawgs. Discrete Appl. Math. 92(2-3), 193–203 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sciortino, M., Zamboni, L.Q.: Suffix automata and standard sturmian words. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 382–398. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Applicazioni, Università di Salerno, Italy

    Gabriele Fici

Authors
  1. Gabriele Fici
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Symeon Bozapalidis

  2. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fici, G. (2009). Combinatorics of Finite Words and Suffix Automata. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03564-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03563-0

  • Online ISBN: 978-3-642-03564-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation