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

DOI10.1016/0304-3975(86)90145-3zbMATH Open0638.68081OpenAlexW2086683111MaRDI QIDQ1099640FDOQ1099640

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Une approche quantitative de l'exclusion mutuelle

Cited In (6)

• On recognising words that are squares for the shuffle product
• Shuffle factorization is unique
• On Shuffle Ideals
• Algorithmic and algebraic aspects of unshuffling permutations
• Recognizing binary shuffle squares is \textsf{NP}-hard
• Title not available (Why is that?)

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)