The Ehrenfeucht-Mycielski Sequence
We study the disjunctive binary sequence introduced by Ehrenfeucht and Mycielski in . The match length associated to the bits of the sequence is shown to be a crucial tool in the analysis of the sequence. We show that the match length between two consecutive bits in the sequence differs at most by 1 and give a lower bound for the limiting density of the sequence. Experimental computation in the automata package has been very helpful in developing these results.
KeywordsInitial Segment Simple Cycle Irregular Word Match Position Match Length
Unable to display preview. Download preview PDF.
- Sloane, N. J.A.: The on-line encyclopedia of integer sequences. (www.research.att.com/~njas/sequences)Google Scholar
- Sutner, K.: automata, a hybrid system for computational automata theory. In Champarnaud, J. M., Maurel, D., eds.: CIAA 2002, Tours, France (2002) 217–222Google Scholar
- Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills, CA (1982)Google Scholar
- Calude, C., Yu, S.: Language-theoretic complexity of disjunctive sequences. Technical Report 007, CDMTCS (1995)Google Scholar
- Hodsdon, A.: The generalized Ehrenfeucht-Mycielski sequences. Master’s thesis, Carnegie Mellon University (2002)Google Scholar
- McConnell, T.R.: Laws of large numbers for some non-repetitive sequences. http://barnyard.syr.edu/research.shtml (2000)