Abstract
We study the disjunctive binary sequence introduced by Ehrenfeucht and Mycielski in [1]. 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ehrenfeucht, A., Mycielski, J.: A pseudorandom sequence-how random is it? American Mathematical Monthly 99 (1992) 373–375
Sloane, N. J.A.: The on-line encyclopedia of integer sequences. (www.research.att.com/~njas/sequences)
Wolfram, S.: The Mathematica Book. 4th edn. Wolfram Media, Cambridge UP (1999)
Sutner, K.: automata, a hybrid system for computational automata theory. In Champarnaud, J. M., Maurel, D., eds.: CIAA 2002, Tours, France (2002) 217–222
Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills, CA (1982)
Calude, C., Yu, S.: Language-theoretic complexity of disjunctive sequences. Technical Report 007, CDMTCS (1995)
Hodsdon, A.: The generalized Ehrenfeucht-Mycielski sequences. Master’s thesis, Carnegie Mellon University (2002)
McConnell, T.R.: Laws of large numbers for some non-repetitive sequences. http://barnyard.syr.edu/research.shtml (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sutner, K. (2003). The Ehrenfeucht-Mycielski Sequence. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-45089-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40561-0
Online ISBN: 978-3-540-45089-4
eBook Packages: Springer Book Archive