On uniform recurrence of HD0l systems

Details On uniform recurrence of HD0l systems On uniform recurrence of HD0l systems

2011-11-08

arxiv.org/abs/1111.1999v2

Mathematics

Combinatorics

20 pages, in Russian

Scientific paper

We prove that the problem of deciding whether a given morphic sequence is
uniformly recurrent is decidable. The proof uses decidability of HD0L
periodicity problem, which was recently proved in papers of F.Durand and
I.Mitrofanov.

Affiliated with

Also associated with

No associations

Rating

On uniform recurrence of HD0l systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On uniform recurrence of HD0l systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On uniform recurrence of HD0l systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-54340