An aperiodicity problem for multiwords

DOI10.1051/ita/2011131zbMath1247.68203OpenAlexW2158739756MaRDI QIDQ2911425

Olivier Carton, Alexandre Decan, Olivier Gauwin, Véronique Bruyère, Jef Wijsen

Publication date: 31 August 2012

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/221995

zbMATH Keywords

pattern matchingaperiodicitypartial words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
• Fast pattern-matching on indeterminate strings
• Partial words and a theorem of Fine and Wilf
• Relational codes of words
• A fast string searching algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• On finite monoids having only trivial subgroups
• Uniqueness Theorems for Periodic Functions
• Algorithms on Strings