Un algorithme determinant les melanges de deux mots

  • Jean-Claude Spehner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)


A word c of the free monoid C* over the alphabet C is called a shuffle of the words u and v of C* if there exists k>0 and words u1, ..., uk, v1, ..., vk of C* such that u = u1 ... uk, v = v1 ... vk and c = u1v1u2v2 ... ukvk. We give here an algorithm which computes the shuffles of two words without omission or repetition.


Free Monoid Grand Facteur Nous Utilisons Permute Place ALGORITHME Determinant 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    Blumer A., Blumer J., Ehrenfeucht A., Haussler D. and Mc. Connell R., Building the minimal DFA for the set of all subwords of a word online in linear time, ICALP 84 L. Notes in Computer Science, 172, 109–118.Google Scholar
  2. (2).
    Crochemore M., Optimal factor transducers, Publication LITP, Paris 84–36 (1984).Google Scholar
  3. (3).
    Eilenberg S., Automata, languages and Machines, Vol. A, Academic Press (1974).Google Scholar
  4. (4).
    Van Leeuwen J. and Nivat M., Efficient Recognition of Rational Relations, Publication LITP Paris VI no 81.30 (1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jean-Claude Spehner
    • 1
  1. 1.I.S.E.A., Université de Haute AlsaceMulhouse CédexFrance

Personalised recommendations