The Isomorphism Problem for ω-Automatic Trees
From MaRDI portal
Publication:3586055
DOI10.1007/978-3-642-15205-4_31zbMath1287.03084OpenAlexW2098335674MaRDI QIDQ3586055
Markus Lohrey, Jiamou Liu, Dietrich Kuske
Publication date: 3 September 2010
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15205-4_31
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computable structure theory, computable model theory (03C57)
Related Items (5)
Deciding Parity Games in Quasi-polynomial Time ⋮ Automatic models of first order theories ⋮ A hierarchy of tree-automatic structures ⋮ The isomorphism problem for tree-automatic ordinals with addition ⋮ The isomorphism problem on classes of automatic structures with transitive relations
This page was built for publication: The Isomorphism Problem for ω-Automatic Trees