Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

LICS
2010
IEEE

favoriteEmaildiscussreport

174views Automated Reasoning» more LICS 2010»

The Isomorphism Problem on Classes of Automatic Structures

13 years 8 months ago

The Isomorphism Problem on Classes of Automatic Structures

Download www.informatik.uni-leipzig.de

Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii) The isomorphism problem for automatic trees of height n 2 is 0 2n-3-complete. (iii) The isomorphism problem for automatic linear orders is not arithmetical.

Dietrich Kuske, Jiamou Liu, Markus Lohrey

Real-time Traffic

Automated Reasoning | Automatic Equivalence Relations | Automatic Linear Orders | Isomorphism Problem | LICS 2010 |

claim paper

Related Content

» The Isomorphism Relation Between TreeAutomatic Structures

» Automatic Structures Richness and Limitations

» From Automatic Structures to Borel Structures

» Graph Classes Between Parity and Distancehereditary Graphs

» Automatic Generation of Classification Theorems for Finite Algebras

» Canonical Data Structure for Interval Probe Graphs

» Automatic Construction and Verification of Isotopy Invariants

» Faithful mapping of model classes to mathematical structures

» Nontrivial tdesigns without repeated blocks exist for all t

Post Info
More Details (n/a)

Added	14 Feb 2011
Updated	14 Feb 2011
Type	Journal
Year	2010
Where	LICS
Authors	Dietrich Kuske, Jiamou Liu, Markus Lohrey

Comments (0)