Affordable Access

Publisher Website

Le calcul rapide des melanges de deux mots

Authors
Journal
Theoretical Computer Science
0304-3975
Publisher
Elsevier
Publication Date
Volume
47
Identifiers
DOI: 10.1016/0304-3975(86)90145-3
Disciplines
  • Computer Science

Abstract

Abstract A word c of the free monoid C over the alphabet C is called a shuffle of the words u and ν of C if there exist a k>0 and words u 1, …, u k , ν 1, …, ν k of C such that u = u 1 … u k , ν = ν 1 … ν k and c = u 1 ν 1 u 2 ν 2 … u k ν k . Here we give an algorithm which computes the shuffles of two words without omission or repetition.

There are no comments yet on this publication. Be the first to share your thoughts.