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

shufflepattern matchingfree monoid

Mathematics Subject Classification ID

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

Cites work

• 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?)
• Fast Pattern Matching in Strings
• Une approche quantitative de l'exclusion mutuelle

Cited in

(6)

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

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)