A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Jean Néraud / rank | |||
Property / author | |||
Property / author: Maxime Crochemore / rank | |||
Property / author | |||
Property / author: Jean Néraud / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Maxime Crochemore / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sur le théorème du defaut / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transducers and repetitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3758253 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4027623 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Periodes et repetitions des mots du monoide libre / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniqueness Theorems for Periodic Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3862379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5673640 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5625457 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elementariness of a finite set of words is co-NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the deficit of a finite set of words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4200990 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A greedy approximation algorithm for constructing shortest common superstrings / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126422855 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(92)90140-b / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1991728769 / rank | |||
Normal rank |
Latest revision as of 11:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) |
scientific article |
Statements
A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (English)
0 references
26 September 1992
0 references
string-matching
0 references
linear time algorithm
0 references
on-line algorithm
0 references