Deciding the isomorphism problem in classes of unary automatic structures

被引：9
|
作者：
Liu, Jiamou [1 ]
Minnes, Mia [2 ]
机构：
[1] Univ Auckland, Dept Comp Sci, Auckland 1, New Zealand
[2] MIT, Dept Math, Cambridge, MA 02139 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2011年 / 412卷 / 18期
基金：
美国国家科学基金会;
关键词：
Unary automatic structures; The isomorphism problem; Graphs;
D O I：
10.1016/j.tcs.2010.12.045
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We 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.(1) (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：1705 / 1717
页数：13
相关论文
共 50 条
12345