A string-matching interpretation of the equation \(x^ m y^ n = z^ p\)

DOI10.1016/0304-3975(92)90140-BzbMath0747.68024OpenAlexW1991728769WikidataQ126422855 ScholiaQ126422855MaRDI QIDQ1190459

Jean Néraud, Maxime Crochemore

Publication date: 26 September 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90140-b

zbMATH Keywords

on-line algorithmlinear time algorithmstring-matching

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
• A greedy approximation algorithm for constructing shortest common superstrings
• Sur le théorème du defaut
• Periodes et repetitions des mots du monoide libre
• Transducers and repetitions
• On the deficit of a finite set of words
• Elementariness of a finite set of words is co-NP-complete
• Efficient string matching
• Fast Pattern Matching in Strings
• Uniqueness Theorems for Periodic Functions

This page was built for publication: A string-matching interpretation of the equation \(x^ m y^ n = z^ p\)