Isomorphisms of scattered automatic linear orders

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We prove that the isomorphism of scattered tree automatic linear orders as
well as the existence of automorphisms of scattered word automatic linear
orders are undecidable. For the existence of automatic automorphisms of word
automatic linear orders, we determine the exact level of undecidability in the
arithmetical hierarchy.

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

Isomorphisms of scattered automatic linear orders 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 Isomorphisms of scattered automatic linear orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isomorphisms of scattered automatic linear orders will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-138824

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