The isomorphism problem on classes of automatic structures
Files
Date
Supervisor
Item type
Conference Contribution
Degree name
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE Computer Society
Abstract
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is \Pi^0_1-complete, (ii) The isomorphism problem for automatic trees of height n≥2 is \Pi^0_{2n-3}-complete, (iii) The isomorphism problem for automatic linear orders is not arithmetical.Description
Source
Presentation at the 25th annual IEEE symposium on logic in computer science (LICS'10), Edinburgh, UK, pp. 160 - 169
Publisher's version
Rights statement
Copyright © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.