Crucial Words and the Complexity of Some Extremal Problems for Sets of Prohibited Words
| dc.creator | Evdokimov, A. | |
| dc.creator | Kitaev, S. | |
| dc.date | 2002-05-20 | |
| dc.date.accessioned | 2026-07-07T04:48:36Z | |
| dc.date.available | 2026-07-07T04:48:36Z | |
| dc.description | We introduced the notation of a set of prohibitions and give definitions of a complete set and a crucial word with respect to a given set of prohibitions. We consider 3 particular sets which appear in different areas of mathematics and for each of them examine the length of a crucial word. One of these sets is proved to be incomplete. The problem of determining lengths of words that are free from a set of prohibitions is shown to be NP-complete, although the related problem of whether or not a given set of prohibitions is complete is known to be effectively solvable. | |
| dc.description | 16 pages | |
| dc.identifier | https://arxiv.org/abs/math/0205217 | |
| dc.identifier | http://arxiv.org/abs/math/0205217 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64113 | |
| dc.subject | Combinatorics | |
| dc.title | Crucial Words and the Complexity of Some Extremal Problems for Sets of Prohibited Words | |
| dc.type | text |