Isomorphisms of scattered automatic linear orders
Computer Science Logic(2012)
摘要
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.
更多查看译文
关键词
Linear orders,Automatic structures,Context-free linear orders
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要