Two recognizable string-matching problems over free partially commutative monoids (Q1190454)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two recognizable string-matching problems over free partially commutative monoids |
scientific article; zbMATH DE number 55519
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two recognizable string-matching problems over free partially commutative monoids |
scientific article; zbMATH DE number 55519 |
Statements
Two recognizable string-matching problems over free partially commutative monoids (English)
0 references
26 September 1992
0 references
An efficient (linear-time) algorithm for the following problem is given. For two strings \(x,y\) determine if \([x]\) is a factor of \([y]\), where \([z]\) denotes an element of a free partially commutative monoid generated by a word \(z\). Moreover, some variants of this basic problem are examined.
0 references
string-matching algorithms
0 references
0.97491914
0 references
0.87364703
0 references
0.86928433
0 references
0 references
0.84446126
0 references
0.84146345
0 references
0.84002984
0 references
