Skip to main content
SpringerLink
Log in

Enumerative combinatorics on words

  • Chapter
Book cover Algebraic Combinatorics and Computer Science

Abstract

Generating series, also called generating functions, play an important role in combinatorial mathematics. Many enumeration problems can be solved by transferring the basic operations on sets into algebraic operations on formal series leading to a solution of an enumeration problem. The famous paper by Doubilet, Rota and Stanley, The idea of generating function [40], places the subject in a general mathematical frame-work allowing one to present in a unified way the diversity of generating functions, from the ordinary ones to the exponential or even Dirichlet.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Adler, R.L., Coppersmith, D., Hassner, M. (1983): Algorithms for sliding block codes. An application of symbolic dynamics to information theory. IEEE Trans. Inform. Theory 29, 5–22

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahlswede, R., Balkenhol, B., Khachatrian, L. (1997): Some properties of fix-free codes. Preprint 97-39. Fakultät für Mathematik, Universität Bielefeld

    Google Scholar 

  3. Aigner, M., Ziegler, G.M. (1998): Proofs from The Book. Springer, Berlin

    MATH  Google Scholar 

  4. Ash, R.B. (1990): Information theory. Dover, New York

    MATH  Google Scholar 

  5. Ashley, J.J. (1998): A linear bound for sliding-block decoder window size. IEEE Trans. Inform. Theory 34, 389–399

    Article  MathSciNet  Google Scholar 

  6. Bassino, F. (1999): Generating functions of circular codes. Adv. in Appl. Math. 22, 1–24

    Article  MathSciNet  MATH  Google Scholar 

  7. Bassino, F., Béal, M.-P., Perrin, D. (1997): Enumerative sequences of leaves in rational trees. In: Degano, P. et al. (eds.) Automata, Languages and Programming. (Lecture Notes in Computer Science, vol. 1256), Springer, Berlin, pp. 76–86

    Chapter  Google Scholar 

  8. Bassino, F., Béal, M.-P., Perrin, D. (1999): Enumerative sequences of leaves and nodes in rational trees. Theoret. Comput. Sci. 221, 41–60

    Article  MathSciNet  MATH  Google Scholar 

  9. Bassino, F., Béal, M.-P., Perrin, D. (1999): Length distributions and regular sequences, In: Rosenthal, J., Marcus, B. (eds.) Codes, Systems and Graphical Models. (IMA Volumes in Mathematics and its Applications, vol.123). Springer, New York

    Google Scholar 

  10. Bassino, F., Béal, M.-P., Perrin, D. (2000): A finite state version of the Kraft-McMillan theorem. SIAM J. Comput. 30, 1211–1230

    Article  MathSciNet  MATH  Google Scholar 

  11. Béal, M.-P. (1993): Codage symbolique. Masson, Paris

    Google Scholar 

  12. Béal, M.-P. (1995): Puissance extérieure d’un automate déterministe, application au calcul de la fonction zêta d’un système sofique. RAIRO Inform. Théor. Appl. 29, 85–103

    MATH  Google Scholar 

  13. Béal, M.-P., Mignosi, F., Restivo, A. (1996): Minimal forbidden words and symbolic dynamics. In: Puech, C., Reischuk, R. (eds.) STACS96. (Lecture Notes in Computer Science, vol. 1046). Springer, Berlin, pp. 555–566

    Google Scholar 

  14. Béal, M.-P., Mignosi, F., Restivo, A., Sciortino, M. (2000): Forbidden words in symbolic dynamics. Adv. in Appl. Math. 25, 163–193

    Article  MathSciNet  MATH  Google Scholar 

  15. Béal, M.-P., Perrin, D. (1997): Symbolic dynamics and finite automata. In: Rosenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2. Springer, Berlin, pp. 463–505

    Google Scholar 

  16. Berstel, J., Perrin, D. (1985): Theory of codes. Academic Press, Orlando, FL

    MATH  Google Scholar 

  17. Berstel, J., Reutenauer, C. (1990): Zeta functions of formal languages. Trans. Amer. Math. Soc. 321, 533–546

    Article  MathSciNet  MATH  Google Scholar 

  18. Berstel, J., Reutenauer, C. (1988): Rational series and their languages. Springer, Berlin

    Book  MATH  Google Scholar 

  19. Bowen, R., Lanford, O.E. (1970): Zeta functions of restrictions of the shift transformation. In: Chern, S.-S., Smale, S. (eds.) Global Analysis. (Proceedings of Symposia in Pure Mathematics, vol. 14). American Mathematical Society, Providence, RI, pp. 43–49

    Google Scholar 

  20. Bowen, R. (1978): On Axiom A diffeomorphisms. (Regional Conferenc Series in Mathematics, no. 35). American Mathematical Society, Providence, RI

    MATH  Google Scholar 

  21. Bruyère, V., Latteux, M. (1996): Variable-length maximal codes. In: Meyer auf der Heide, F., Monien, B. (eds.) Automata, Languages and Programming. (Lecture Notes in Computer Science, vol. 1099). Springer, Berlin, pp. 24–47

    Chapter  Google Scholar 

  22. Eilenberg, S. (1974): Automata, languages and machines, vol. A. Academic Press, New York

    MATH  Google Scholar 

  23. Flajolet, P. (1987): Analytic models and ambiguity of context-free languages. Theoret. Comput. Sci. 49, 283–309

    Article  MathSciNet  MATH  Google Scholar 

  24. Forney, G.D., Marcus, B.H., Sindhushayana, N.T., Trott, M. (1995): Multilingual dictionary: system theory, coding theory, symbolic dynamics, and automata theory. In: Calderbank, R. (ed.) Different Aspects of Coding Theory. (Proceedings of Symposia in Applied Mathematics, vol. 50). American Mathematical Society, Providence, RI, pp. 109–138

    Google Scholar 

  25. Gantmatcher, F.R. (1959): Theory of matrices, vol. 2. Chelsea, New York

    Google Scholar 

  26. Graham, R.L., Knuth, D., Patachnik, O. (1989): Concrete mathematics. A foundation for computer science. Addison Wesley, Reading, MA

    Google Scholar 

  27. Katayama, T., Okamoto, M., Enomoto, H. (1978): Characterization of the structuregenerating functions of regular sets and the DOL growth functions. Information and Control 36, 85–101

    Article  MathSciNet  MATH  Google Scholar 

  28. Kitchens, B. P. (1998): Symbolic dynamics. One-sided, two-sided and countable state Markov shifts. Springer, Berlin

    MATH  Google Scholar 

  29. Lang, S. (1984): Algebra, 2nd edition. Addison Wesley, Reading, MA

    MATH  Google Scholar 

  30. Lind, D.A., Marcus, B.H. (1995): An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  31. Lothaire, M. (1997): Combinatorics on words. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  32. Macdonald, I.G. (1995): Symmetric functions and Hall polynomials, 2nd edition. Clarendon Press, Oxford

    MATH  Google Scholar 

  33. Manning, A. (1971): Axiom A diffeomorphisms have rational zeta functions. Bull. London Math. Soc. 3, 215–220

    Article  MathSciNet  MATH  Google Scholar 

  34. Marcus, B.H. (1979): Factors and extensions of full shifts. Monatsh. Math. 88, 239–247

    Article  MathSciNet  MATH  Google Scholar 

  35. Marcus, B.H., Roth, R.M., Siegel, PH. (1998): Constrained systems and coding for recording channels. In: Pless, V.S. et al. (eds.) Handbook of Coding Theory, vol. II. North Holland, Amsterdam, pp. 1635–1764

    Google Scholar 

  36. Metropolis, N., Rota, G.-C. (1983): Witt vectors and the algebra of necklaces. Adv. Math. 50, 95–125

    Article  MathSciNet  MATH  Google Scholar 

  37. Perrin, D. (1990): Finite Automata. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B. Elsevier, Amsterdam, pp. 1–57

    Google Scholar 

  38. Reutenauer, C. (1997): Personal communication

    Google Scholar 

  39. Reutenauer, C. (1997): N-rationality of zeta functions. Adv. in Appl. Math. 29, 1–17

    Article  MathSciNet  Google Scholar 

  40. Rota, G.-C. (1975): Finite operator calculus. Academic Press, New York

    MATH  Google Scholar 

  41. Salomaa, A., Soittola, M. (1978): Automata-theoretic properties of formal power series. Springer, New York

    Book  Google Scholar 

  42. Scharf, T., Thibon, J.-Y. (1996): On Witt vectors and symmetric functions. Algebra Colloq. 3, 231–238

    MathSciNet  MATH  Google Scholar 

  43. Stanley, R.P. (1997): Enumerative combinatorics, vol. 1. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  44. Ye, C., Yeung, R.W. (2000): Basic properties of fix-free codes. IEEE Trans. Inform. Theory, submitted

    Google Scholar 

Download references

Authors
  1. D. Perrin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre d’Analyse et Mathematique Sociales, E.H.E.S.S. — C.N.R.S., Paris, France

    H. Crapo

  2. Dipartimento di Matematica, Università della Basilicata, Potenza, Italy

    D. Senato

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Italia

About this chapter

Cite this chapter

Perrin, D. (2001). Enumerative combinatorics on words. In: Crapo, H., Senato, D. (eds) Algebraic Combinatorics and Computer Science. Springer, Milano. https://doi.org/10.1007/978-88-470-2107-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-88-470-2107-5_16

  • Publisher Name: Springer, Milano

  • Print ISBN: 978-88-470-2159-4

  • Online ISBN: 978-88-470-2107-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation