Article contents
Unavoidable regularities and factor permutations of words
Published online by Cambridge University Press: 14 November 2011
Extract
We show that for every finite set A and for every natural number n, there exists a natural number N such that every word of length N over the alphabet A has, for every permutation π of the numbers 1,…,n, a representation of the form Xw1 … wnzwπ(1) … wπ(n) Y, where X, Y are words and w1,…,wn, z are nonempty words over A.
- Type
- Research Article
- Information
- Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 125 , Issue 3 , 1995 , pp. 519 - 524
- Copyright
- Copyright © Royal Society of Edinburgh 1995
References
- 1
- Cited by