Enumeration of bordered words, le langage de la vache-qui-rit

M. Régnier

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1992)

  • Volume: 26, Issue: 4, page 303-317
  • ISSN: 0988-3754

How to cite

top

Régnier, M.. "Enumeration of bordered words, le langage de la vache-qui-rit." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 26.4 (1992): 303-317. <http://eudml.org/doc/92420>.

@article{Régnier1992,
author = {Régnier, M.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {-minimality; properties of -bordered words; asymptotics on - bordered words},
language = {eng},
number = {4},
pages = {303-317},
publisher = {EDP-Sciences},
title = {Enumeration of bordered words, le langage de la vache-qui-rit},
url = {http://eudml.org/doc/92420},
volume = {26},
year = {1992},
}

TY - JOUR
AU - Régnier, M.
TI - Enumeration of bordered words, le langage de la vache-qui-rit
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1992
PB - EDP-Sciences
VL - 26
IS - 4
SP - 303
EP - 317
LA - eng
KW - -minimality; properties of -bordered words; asymptotics on - bordered words
UR - http://eudml.org/doc/92420
ER -

References

top
  1. [CP] M. CROCHEMORE and D. PERRIN, Pattern matching in strings, L.I.T.P., Paris, Research Report, 88-5. 
  2. [Dar78] G. DARBOUX, Mémoire sur l'approximation des fonctions de très grands nombres, et sur une classe étendue de développements en série, J. Math. Pures Appl., février 1978, pp. 5-56, 377-416. JFM10.0279.01
  3. [Fla84] FLAJOLET, Algorithmique, in Encyclopedia Universalis, 1, pp. 758-763. Éditions de l'E. U., 1984. 
  4. [GJ83] I. P. GOULDEN and D. M. JACKSON, Combinatorial Enumeration, John Wiley, New York, 1983. Zbl0519.05001MR702512
  5. [Lot83] LOTHAIRE, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983. Zbl0514.20045MR675953
  6. [Odl85] A. ODLYZKO, Enumeration of strings, in A. APOSTOLICO and Z. GALIL Ed., Combinatorial Algorithms on Words, 12 of NATO Advance Science Institute Series, Series F: Computer and Systems Sciences, pp. 203-228, Springer Verlag, 1985. Zbl0603.68074MR815327
  7. {Rég89] M. RÉGNIER, Knuth-Morris-Pratt algorithm: an analysis, in MFCS'89, 379, Lecture Notes in Comput. Sci., pp. 431-444, Springer-Verlag, 1989. Proc. Mathematical Foundations for Computer Science 89, Porubka, Poland. Zbl0755.68074MR1036822
  8. [Ste84] J.-M. STEYAERT, Structure et complexité des algorithmes. Thèse d'État, Université de Paris-VII, 1984. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.