Bulletin of Symbolic Logic

Automata presenting structures: A survey of the finite string case

Sasha Rubin

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


A structure has a (finite-string) automatic presentation if 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.

Article information

Bull. Symbolic Logic Volume 14, Issue 2 (2008), 169-209.

First available in Project Euclid: 17 April 2008

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Rubin, Sasha. Automata presenting structures: A survey of the finite string case. Bull. Symbolic Logic 14 (2008), no. 2, 169--209. doi:10.2178/bsl/1208442827. http://projecteuclid.org/euclid.bsl/1208442827.

Export citation