Multiple factorizations of words and defect effect

Authors:
Juhani Kharhumäki;Ján Maňuch
Affiliations:
Univ. of Turku, Turku, Finland;Univ. of Turku, Turku, Finland
Venue:
Theoretical Computer Science
Year:
2002

Citing 7
Cited 2

A property of three-element codes

Theoretical Computer Science
A proof of Ehrenfeucht's conjecture

Theoretical Computer Science
A defect property of codes with unbounded delays

Discrete Applied Mathematics
On the size of independent systems of equations in semigroups

MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Combinatorics of words

Handbook of formal languages, vol. 1
A defect theorem for bi-infinite words

Theoretical Computer Science
On Defect Effect of Bi-Infinite Words

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science

Many aspects of defect theorems

Theoretical Computer Science - Words, languages and combinatorics
How Many Figure Sets Are Codes?

Language and Automata Theory and Applications

Quantified Score

Hi-index	5.23

Visualization

Abstract

We prove that if X is a finite prefix set and w is a non-periodic bi-infinite word, possessing 3 disjoint X-factorizations, then the combinatorial rank of X is at most card(X)2. This is one of the rare cases when a cumulative defect effect is known to hold. Finally, connections to the critical factorization theorem are discussed.