A new proof for the decidability of D0L ultimate periodicity

Details A new proof for the decidability of D0L ultimate periodicity A new proof for the decidability of D0L ultimate periodicity

2011-08-18

arxiv.org/abs/1108.3631v1

EPTCS 63, 2011, pp. 147-151

Computer Science

Formal Languages and Automata Theory

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.20

We give a new proof for the decidability of the D0L ultimate periodicity
problem based on the decidability of p-periodicity of morphic words adapted to
the approach of Harju and Linna.

Affiliated with

Also associated with

No associations

Rating

A new proof for the decidability of D0L ultimate periodicity 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 A new proof for the decidability of D0L ultimate periodicity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new proof for the decidability of D0L ultimate periodicity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180622