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
The equivalence problem of multitape finite automata
Theoretical Computer Science
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
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 1
Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Automata, Languages, and Machines
Automata, Languages, and Machines
Multiple factorizations of words and defect effect
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
A defect theorem for bi-infinite words
Theoretical Computer Science
How Many Figure Sets Are Codes?
Language and Automata Theory and Applications
A note on defect theorems for 2-dimensional words and trees
Journal of Automata, Languages and Combinatorics
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Hi-index | 0.01 |
We give a survey and a unified presentation of the defect theorem, its generalizations and recent aspects of interest. In its basic form, the defect theorem states that if a set of n words satisfies a nontrivial relation, then these words can be expressed simultaneously as products of at most n - 1 words. In other words, dependency of words causes a defect effect. There does not exist just one defect theorem, but several ones depending on the restrictions that are put to the n - 1 words. The defect theorem is closely related to equations of words, and in this way to the compactness theorem for systems of word equations.