Skip to main content
SpringerLink
Log in

Structure, Combinatorics, and Complexity of “Words”

  • Chapter
Imagination and Rigor

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. Caianiello, E.R., de Luca, A. (1966) Decision equation for binary systems. Application to neuronal behaviour, Kybernetik 3, 33–40

    Article  Google Scholar 

  2. Caianiello, E.R., de Luca, A., Ricciardi, L.M. (1967) Reverberations and control of neural networks, Kybernetik 4, 10–18

    Article  Google Scholar 

  3. Caianiello, E.R., de Luca, A., Ricciardi, L.M. (1967) Reverberations, constants of the motion and general behaviour, In: Neural Networks (Caianiello, E.R., ed.), Proc. International School on Neural Networks (Ravello), Springer-Verlag, Berlin, 1968, pp. 92–99

    Google Scholar 

  4. Caianiello, E.R. (1973) Combinatorics and Renormalization in Quantum Field Theory, Frontiers in Physics, Lecture Notes Series, W.A. Benjamin, Inc., Reading MA

    Google Scholar 

  5. Lothaire, M. (1997) Combinatorics on Words, Addison-Wesley, Reading, MA, 1983; 2nd edition, Cambridge University Press, Cambridge

    Google Scholar 

  6. Lothaire, M. (1992) Algebraic Combinatorics on Words, Cambridge University Press, Cambridge

    Google Scholar 

  7. Braitenberg, V. (1996) Il gusto della lingua. Meccanismi cerebrali e strutture grammaticali, Alpha & Beta Verlag, Merano

    Google Scholar 

  8. Shannon, C.E., Weaver, W. (1963) The Mathematical Theory of Communication, The University of Illinois Press, Urbana

    Google Scholar 

  9. Crochemore, M., Mignosi, F., Restivo, A., Salemi, S. (2000) Data compression using antidictionaries, In: Proc. IEEE, Special issue on Lossless Data Compression, Vol. 88, Storer, J.A. (ed.) 1756–1768

    Google Scholar 

  10. Lempel, A., Ziv, J. (1977) A universal algorithm for sequential data compression, IEEE Trans. Inf. Theory 23, 337–343

    Article  MATH  MathSciNet  Google Scholar 

  11. Caianiello, E.R., Crocchiolo, C. (1965) Programma “Procuste” per l’analisi di linguaggi naturali, Calcolo 2, 83–101

    MATH  Google Scholar 

  12. de Luca, A., Varricchio, S. (1999) Finiteness and Regularity in Semigroups and Formal Languages, Springer-Verlag, Berlin

    Google Scholar 

  13. Chadwick, J. (1990) The Decipherment of Linear B, 2nd edition, Cambridge University Press, Cambridge

    Google Scholar 

  14. Allouche, J.-P., Shallit, J. (2003) Automatic Sequences, Cambridge University Press, Cambridge

    Google Scholar 

  15. Huntley, H.E. (1970) The Divine Proportion. A Study in Mathematical Beauty, Dover Publications Inc. New York

    Google Scholar 

  16. de Luca, A., Mignosi, F. (1994) Some combinatorial properties of Sturmian words, Theoret. Comput. Sci. 136, 361–385

    Article  MATH  MathSciNet  Google Scholar 

  17. de Luca, A., Varricchio, S. (1988) On the factors of the Thue-Morse word on three symbols, Inf. Process. Lett. 27, 281–285

    Article  MATH  Google Scholar 

  18. Carpi, A., de Luca, A. (2003) Full and uniform sequences, Proc. Steklov Inst. Math. 242, 130–135

    MATH  Google Scholar 

  19. Carpi, A., de Luca, A. (2004) Uniform words, Adv. Appl. Math., 32, 485–522

    Article  MATH  Google Scholar 

  20. Knuth, D.E. (1981) The Art of Computer Programming, Vol. 2, 2nd edition, Addison-Wesley, Reading MA

    Google Scholar 

  21. Li, M., Vitanyi, P. (1993) An Introduction to Kolmogorov Complexity and its Applications. Texts and monographs in Computer Science, Springer-Verlag, Berlin

    Google Scholar 

  22. Colosimo, A., de Luca, A. (2000) Special factors in biological strings, J. Theor. Biol. 204, 29–46

    Article  Google Scholar 

  23. Carpi, A., de Luca, A., Varricchio, S. (2002) Words, univalent factors, and boxes, Acta Informatica 38, 409–436

    Article  MATH  MathSciNet  Google Scholar 

  24. Carpi, A., de Luca, A. (2001) Words and special factors, Theoret. Comput. Sci. 259, 145–182

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  26. Carpi, A. de Luca, A. (1999) Repetitions and boxes in words and pictures, In: Karhumäki, J., Maurer, H., Păun G., and Rozenberg, G. (eds.), Jewels are Forever, Springer-Verlag, Berlin, 295–306.

    Google Scholar 

  27. Carpi, A., de Luca, A. (2002) A combinatorial property of the factor poset of a word, Inf. Process. Lett. 81, 35–39

    Article  MATH  Google Scholar 

  28. Carpi, A., de Luca, A., Varricchio, S. (2001) Special factors and uniqueness conditions in rational trees, Theor. Comput. Syst. 34, 375–395

    MATH  Google Scholar 

  29. Carpi, A., de Luca, A. (2002) On the distribution of characteristic parameters of words, Theoret. Informatics Appl. 36, 67–96

    Article  MATH  Google Scholar 

  30. Carpi, A., de Luca, A. (2002) On the distribution of characteristic parameters of words II, Theoret. Informatics Appl. 36, 97–127

    Article  MATH  Google Scholar 

  31. Mignosi, F., Restivo, A., Sciortino, M. (2001) Forbidden factors and fragment assembly, Theoret. Informatics Appl. 35, 565–578

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  33. Carpi, A., de Luca, A. (2001) Some generalizations of periodic words, Bull. Belg. Math. Soc. 8, 257–275

    MATH  Google Scholar 

  34. Carpi, A., de Luca, A. (2003) Semiperiodicwords and root-conjugacy, Theoret. Comput. Sci. 292, pp. 111–130.

    Article  MATH  MathSciNet  Google Scholar 

  35. Kececioglu, J.D., Myers, E.W. (1995) Combinatorial algorithms for DNA sequence assembly, Algorithmica 13, 7–51

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Applicazioni, Università degli Studi di Napoli “Federico II”, Complesso Universitario di Monte S. Angelo, 80126, Naples, Italy

    Aldo de Luca

  2. Istituto di Cibernetica “E. R. Caianiello” del C.N.R., 80078, Pozzuoli (NA), Italy

    Aldo de Luca

Authors
  1. Aldo de Luca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Istituto di Cibernetica “Eduardo Caianiello” del C.N.R., 80078, Pozzuoli (NA), Italy

    Settimo Termini

  2. Dipartimento di Matematica e Applicazioni, Università degli Studi di Palermo, Italy

    Settimo Termini

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Italia

About this chapter

Cite this chapter

de Luca, A. (2006). Structure, Combinatorics, and Complexity of “Words”. In: Termini, S. (eds) Imagination and Rigor. Springer, Milano. https://doi.org/10.1007/88-470-0472-1_7

Download citation

Publish with us

Policies and ethics

Search

Navigation