The Ehrenfeucht-Mycielski Sequence

  • Klaus Sutner
Conference paper

DOI: 10.1007/3-540-45089-0_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

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

Personalised recommendations