Re: Direct Euler Cycle and de Brujin Sequence
- From: "eKo1" <berndlosert@xxxxxxxxxxxx>
- Date: 19 Oct 2006 08:33:39 -0700
Robby Goetschalckx wrote:
Yes, you have correctly shown (I think) that you can construct a De Bruijn
sequence in the alphabet {0,1} of any order using this method.
I wouldn't say "any order" because n must be greater than 1 for the
method to work. Why? Because each vertex is represented by a bit-string
of length n - 1 which is 0 in the case of n = 1.
.
- References:
- Direct Euler Cycle and de Brujin Sequence
- From: eKo1
- Re: Direct Euler Cycle and de Brujin Sequence
- From: Robby Goetschalckx
- Re: Direct Euler Cycle and de Brujin Sequence
- From: eKo1
- Re: Direct Euler Cycle and de Brujin Sequence
- From: eKo1
- Re: Direct Euler Cycle and de Brujin Sequence
- From: eKo1
- Re: Direct Euler Cycle and de Brujin Sequence
- From: Robby Goetschalckx
- Direct Euler Cycle and de Brujin Sequence
- Prev by Date: Re: Growth Rate of Level-k Goodstein Function
- Next by Date: Re: Growth Rate of Level-k Goodstein Function
- Previous by thread: Re: Direct Euler Cycle and de Brujin Sequence
- Next by thread: Re: A Possible "solution" to the Halting Problem
- Index(es):
Relevant Pages
|