Abstract
AbstractA structure has a (finite-string)automatic presentationif the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.
Publisher
Cambridge University Press (CUP)
Reference57 articles.
1. Rubin S. , Automatic structures, Ph.D. thesis, University of Auckland, 2004.
2. Delhommé C. The Rado graph is not automatic, 2001, manuscript.
3. Automatic Presentations for Finitely Generated Groups
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献