Deciding the isomorphism problem in classes of unary automatic structures

aut.researcherLiu, Jiamou
dc.contributor.authorLiu, JL
dc.contributor.authorMinnes, M
dc.contributor.editorAgrawal,
dc.date.accessioned2011-11-27T05:22:36Z
dc.date.accessioned2012-02-01T22:12:47Z
dc.date.available2011-11-27T05:22:36Z
dc.date.available2012-02-01T22:12:47Z
dc.date.copyright2011-04-15
dc.date.issued2011-04-15
dc.description.abstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary automatic equivalence relations, unary automatic linear orders, and unary automatic trees. That is, we provide algorithms which decide whether two given elements of these classes are isomorphic. In doing so, we define new finite representations for these structures which give normal forms.
dc.identifier.citationTheoretical Computer Science, vol.412(18), pp.1705 - 1717
dc.identifier.doi10.1016/j.tcs.2010.12.045
dc.identifier.issn0304-3975
dc.identifier.urihttps://hdl.handle.net/10292/3333
dc.languageEnglish
dc.publisherElsevier
dc.relation.isreplacedby10292/4235
dc.relation.isreplacedbyhttp://hdl.handle.net/10292/4235
dc.relation.replaceshttp://hdl.handle.net/10292/2815
dc.relation.replaces10292/2815
dc.relation.urihttp://www.sciencedirect.com/science/article/pii/S0304397510007462
dc.rightsCopyright © 2011 Elsevier Ltd. All rights reserved. This is the author’s version of a work that was accepted for publication in (see Citation). Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. The definitive version was published in (see Citation). The original publication is available at (see Publisher's Version)
dc.rights.accessrightsOpenAccess
dc.subjectUnary automatic structures
dc.subjectThe isomorphism problem
dc.subjectGraphs
dc.titleDeciding the isomorphism problem in classes of unary automatic structures
dc.typeJournal Article
pubs.organisational-data/AUT
pubs.organisational-data/AUT/Design & Creative Technologies
pubs.organisational-data/AUT/Design & Creative Technologies/School of Computing & Mathematical Science
pubs.organisational-data/AUT/PBRF Researchers
pubs.organisational-data/AUT/PBRF Researchers/Design & Creative Technologies PBRF Researchers
pubs.organisational-data/AUT/PBRF Researchers/Design & Creative Technologies PBRF Researchers/DCT C & M Computing
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
postTAMC.pdf
Size:
150.17 KB
Format:
Adobe Portable Document Format
Description: