Subwords and Power-Free Words are not Expressible by Word Equations

Authors:
Lucian Ilie
Affiliations:
(Correspd.) (Research supported by the Academy of Finland, Project 137358. On leave of absence from Faculty of Mathematics, University of Bucharest, Str. Academiei 14, R-70109 Bucharest, Romania.) ...
Venue:
Fundamenta Informaticae
Year:
1999

Citing 6
Cited 0

Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters

Theoretical Computer Science
Decision problems for patterns

Journal of Computer and System Sciences
Some combinatorial properties of Sturmian words

Theoretical Computer Science
Combinatorics of words

Handbook of formal languages, vol. 1
The Expressibility of Languages and Relations by Word Equations

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Quantifier Hierarchies over Word Relations

CSL '91 Proceedings of the 5th Workshop on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider several open problems of Karhumäki, Mignosi, and Plandowski, cf. [KMP], concerning the expressibility of languages and relations as solutions of word equations. We show first that the (scattered) subword relation is not expressible. Then, we consider the set of k-power-free finite words and solve it negativelly for all nontrivial integer values of k. Finally, we consider the Fibonacci finite words. We do not solve the problem of the expressibility of the set of these words but prove that a negative answer (as believed) cannot be given using the tools in [KMP].