Crucial words and the complexity of some extremal problems for sets of prohibited words
Evdokimov, A. and Kitaev, Sergey (2004) Crucial words and the complexity of some extremal problems for sets of prohibited words. Journal of Combinatorial Theory Series A, 105 (2). pp. 273-289. ISSN 0097-3165
Full text not available in this repository.Request a copy from the Strathclyde authorAbstract
We introduce the notion 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 three special 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.
Creators(s): |
Evdokimov, A. and Kitaev, Sergey ![]() | Item type: | Article |
---|---|
ID code: | 49115 |
Keywords: | abelian squares, NP-completeness, crucial words, unavoidablity, avoidability, Electronic computers. Computer science, Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Theoretical Computer Science |
Subjects: | Science > Mathematics > Electronic computers. Computer science |
Department: | Faculty of Science > Computer and Information Sciences |
Depositing user: | Pure Administrator |
Date deposited: | 06 Sep 2014 02:16 |
Last modified: | 01 Jan 2021 11:01 |
Related URLs: | |
URI: | https://strathprints.strath.ac.uk/id/eprint/49115 |
Export data: |