Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)

DOI10.1016/0304-3975(86)90145-3MaRDI QIDQ1099640zbMATH OpenOpenAlexFDO

Authors Jean-Claude Spehner

Publication date 1986

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(86)90145-3

zbMATH Keywords

free monoidpattern matchingshuffle

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Review text

See the author's article in Lect. Notes Comput. Sci. 226, 387-396 (1986; Zbl 0595.68070).

Cites work

• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3883638 (Why is no real title available?)
• scientific article; zbMATH DE number 3917745 (Why is no real title available?)
• scientific article; zbMATH DE number 3961017 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Une approche quantitative de l'exclusion mutuelle

Cited in

(6)

• Shuffle factorization is unique
• Algorithmic and algebraic aspects of unshuffling permutations
• Recognizing binary shuffle squares is \textsf{NP}-hard
• On recognising words that are squares for the shuffle product
• scientific article; zbMATH DE number 3958758 (Why is no real title available?)
• On Shuffle Ideals

This page was built for publication: Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099640)