Two recognizable string-matching problems over free partially commutative monoids (Q1190454): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(92)90136-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025754710 / rank | |||
Normal rank | |||
Revision as of 18:42, 21 March 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
