On the complexity of some extended word problems defined by cancellation rules (Q578921): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:27, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of some extended word problems defined by cancellation rules |
scientific article |
Statements
On the complexity of some extended word problems defined by cancellation rules (English)
0 references
1986
0 references
We give an algorithm which computes the set of descendants of a regular set R, for Thue systems of certain type. The complexity of the algorithm is \(O(m^ 3)\) where m is the number of states of an automaton recognising R. This allows to improve the known complexity bounds for some extended word problems defined by cancellation rules.
0 references
algorithm
0 references
set of descendants of a regular set
0 references
Thue systems
0 references
complexity bounds
0 references
word problems
0 references
cancellation rules
0 references
