Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1986: Automata, Languages and Programming pp 387–396Cite as

Un algorithme determinant les melanges de deux mots

  • Conference paper
  • First Online:

  • 117 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 226))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Crochemore M., Optimal factor transducers, Publication LITP, Paris 84–36 (1984).

    Google Scholar 

  3. Eilenberg S., Automata, languages and Machines, Vol. A, Academic Press (1974).

    Google Scholar 

  4. Van Leeuwen J. and Nivat M., Efficient Recognition of Rational Relations, Publication LITP Paris VI no 81.30 (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.S.E.A., Université de Haute Alsace, 4, rue des Frères Lumière, 68093, Mulhouse Cédex, France

    Jean-Claude Spehner

Authors
  1. Jean-Claude Spehner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spehner, JC. (1986). Un algorithme determinant les melanges de deux mots. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation