Computer Science – Logic in Computer Science
Scientific paper
2012-04-25
Computer Science
Logic in Computer Science
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
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.
Profile ID: LFWR-SCP-O-138824