Translator Disclaimer
June 2008 Automata presenting structures: A survey of the finite string case
Sasha Rubin
Bull. Symbolic Logic 14(2): 169-209 (June 2008). DOI: 10.2178/bsl/1208442827

Abstract

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.

Citation

Download Citation

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

Information

Published: June 2008
First available in Project Euclid: 17 April 2008

zbMATH: 1146.03028
MathSciNet: MR2413002
Digital Object Identifier: 10.2178/bsl/1208442827

Rights: Copyright © 2008 Association for Symbolic Logic

JOURNAL ARTICLE
41 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.14 • No. 2 • June 2008
Back to Top