The equality problem for infinite words generated by primitive morphisms

Computer Science – Formal Languages and Automata Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Preliminary version of a paper to appear in Information and Computation

Scientific paper

We study the equality problem for infinite words obtained by iterating
morphisms. In particular, we give a practical algorithm to decide whether or
not two words generated by primitive morphisms are equal.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The equality problem for infinite words generated by primitive morphisms 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 The equality problem for infinite words generated by primitive morphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The equality problem for infinite words generated by primitive morphisms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-591667

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.