Two recognizable string-matching problems over free partially commutative monoids (Q1190454): Difference between revisions
From MaRDI portal
Latest revision as of 11:44, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two recognizable string-matching problems over free partially commutative monoids |
scientific article |
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
