Advertisement

The Ehrenfeucht-Mycielski Sequence

  • Klaus Sutner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)

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.

Keywords

Initial Segment Simple Cycle Irregular Word Match Position Match Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ehrenfeucht, A., Mycielski, J.: A pseudorandom sequence-how random is it? American Mathematical Monthly 99 (1992) 373–375CrossRefMathSciNetGoogle Scholar
  2. [2]
    Sloane, N. J.A.: The on-line encyclopedia of integer sequences. (www.research.att.com/~njas/sequences)Google Scholar
  3. [3]
    Wolfram, S.: The Mathematica Book. 4th edn. Wolfram Media, Cambridge UP (1999)zbMATHGoogle Scholar
  4. [4]
    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
  5. [5]
    Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills, CA (1982)Google Scholar
  6. [6]
    Calude, C., Yu, S.: Language-theoretic complexity of disjunctive sequences. Technical Report 007, CDMTCS (1995)Google Scholar
  7. [7]
    Hodsdon, A.: The generalized Ehrenfeucht-Mycielski sequences. Master’s thesis, Carnegie Mellon University (2002)Google Scholar
  8. [8]
    McConnell, T.R.: Laws of large numbers for some non-repetitive sequences. http://barnyard.syr.edu/research.shtml (2000)

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Klaus Sutner
    • 1
  1. 1.Computer Science DepartmentCarnegie Mellon UniversityPittsburgh

Personalised recommendations