Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
Review
2011
Review
2011
Reaction systems are a formal model for processes inspired by the functioning of the living cell. The underlying idea of this… 
Review
2010
Review
2010
A survey for Dipterous flies was conducted in 3 private sheep's' farms and  3 governmental slaughter houses at Abu Arish… 
2003
2003
We study the disjunctive binary sequence introduced by Ehrenfeucht and Mycielski in [1]. The match length associated to the bits… 
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… 
1996
1996
We define Ehrenfeucht-FraIsse games which exactly capture the expressive power of the extremal fixed point operators of modal mu… 
Highly Cited
1986
Highly Cited
1986
We show a generalization of the Ehrenfeucht Conjecture: For every language there exists a (finite) test set with respect to… 
Highly Cited
1983
Highly Cited
1983
Highly Cited
1981
Highly Cited
1981
  • N. Immerman
  • Journal of computer and system sciences (Print)
  • 1981
  • Corpus ID: 40753086