Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Ehrenfeucht–Mycielski sequence

Known as: Ehrenfeucht-Mycielski sequence 
The Ehrenfeucht–Mycielski sequence is a recursively defined sequence of binary digits with pseudorandom properties, defined by Andrzej Ehrenfeucht… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
ABSTRACT Increasing the community participation of people with severe mental illness is a primary goal of recovery-oriented… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In urban middle schools, educators find it challenging to meet the literacy needs of the many struggling readers in their… Expand
Is this relevant?
2009
2009
We introduce the inverted prefix tries (a variation of suffix tries) as a convenient formalism for stating and proving properties… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Oceanic islands freshwater systems are unique due to their volcanic origin, oceanic situation, catchment morphology and the… Expand
  • figure 1
  • table 1
  • table 1
  • figure 2
  • table 4
Is this relevant?
2003
2003
We study the disjunctive binary sequence introduced by Ehrenfeucht and Mycielski in [1]. The match length associated to the bits… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We show a property of strings is expressible in the two-variable fragment of first-order logic if and only if it is express ible… Expand
Is this relevant?
1996
1996
A combinatorial argument for two nite structures to agree on all sentences with bounded quantiier rank in rst-order logic with… Expand
Is this relevant?
1986
1986
We show a generalization of the Ehrenfeucht Conjecture: For every language there exists a (finite) test set with respect to… Expand
Is this relevant?
1983
1983
Ehrenfeucht's conjecture states that every language L has a finite subset F such that, for any pair (g, h) of morphisms, g and h… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We introduce a new complexity measure, QN[f(n)], which measures the size of sentences from predicate calculus needed to express a… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 7
  • figure 8
Is this relevant?