Skip to main content
×
Home
    • Aa
    • Aa

Automata Presenting Structures: A Survey of the Finite String Case

  • Sasha Rubin (a1)
Abstract
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.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[2] V. Bárány , Invariants of automatic presentations and semi-synchronous transductions, STACS 2006 ( B. Durand and W. Thomas , editors), Lecture Notes in Computer Science, vol. 3884, Springer, 2006, pp. 289300.

[7] C. H. Bennett , Logical reversibility of computation, IBM Journal of Research and Development, vol. 17 (1973), no. 6, pp. 525532.

[8] Jean Berstel , Transductions and Context-Free languages, Leitfáden der Angewandten Mathematik und Mechanik [Guides to Applied Mathematics and Mechanics], vol. 38, B. G. Teubner, Stuttgart, 1979.

[14] A. Blumensath Finite presentations of infinite structures: Automata and interpretations, Theory of Computing Systems, vol. 37 (2004), pp. 641674.

[16] J. R. Büchi , Weak second-order arithmetic and finite automata, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 6 (1960), pp. 6692.

[20] D. Cenzer and J. B. Remmel , Complexity-theoretic model theory and algebra, Handbook of recursive mathematics, vol. 1 ( Yu. L. Ershov , S. S. Goncharov , A. Nerode , and J. B. Remmel , editors), Studies in Logic and the Foundations of Mathematics, vol. 138, North-Holland, Amsterdam, 1998, pp. 381513.

[24] C. Delhommé Automaticité des ordinaux et des graphes homogènes, Comptes Rendus Mathematique, Vol. 339 (2004), no. 1, Pp. 510.

[25] J. Doner , Tree acceptors and some of their applications, Journal of Computer and System Sciences, vol. 4 (1970), pp. 406451.

[26] S. Eilenberg , C. C. Elgot , and J. C. Shepherdson , Sets recognised by n-tape automata, Journal of Algebra, vol. 13 (1969), no. 4, pp. 447464.

[27] C. C. Elgot , Decision problems of finite automata design and related arithmetics, Transactions of the American Mathematical Society, vol. 98 (1961), pp. 2151.

[29] L. Hella , Definability hierarchies of generalized quantifiers, Annals of Pure and Applied Logic, vol. 43 (1989), no. 3, pp. 235271.

[31] B. R. Hodgson On direct products of automaton decidable theories, Theoretical Computer Science, vol. 19 (1982), pp. 331335.

[35] B. Khoussainov , A. Nies , S. Rubin , and F. Stephan , Automatic structures: Richness and limitations, Logical Methods in Computer Science, vol. 3 (2007), no. 2, pp. 0–0.

[37] B. Khoussainov Automatic linear orders and trees, ACM Transactions on Computational Logic, vol. 6 (2005), no. 4, pp. 675700.

[48] G. Oliver and R. Thomas , Automatic presentations of finitely generated groups, STACS 2005 ( V. Diekert and B. Durand , editors), Lecture Notes in Computer Science, vol. 3404, Springer, 2005.

[49] M. O. Rabin , Decidability of second-order theories and automata on infinite trees, Transactions of the American Mathematical Society, vol. 141 (1969), pp. 135.

[54] J. W. Thatcher and J. B. Wright , Generalizedfinite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory, vol. 2 (1968), pp. 5781.

[57] R. Villemaire , The theory of (〈N, +, Vk, Vl〉 is undecidable, Theoretical Computer Science, vol. 106 (1992), pp. 337349.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of Symbolic Logic
  • ISSN: 1079-8986
  • EISSN: 1943-5894
  • URL: /core/journals/bulletin-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 3 *
Loading metrics...

Abstract views

Total abstract views: 48 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 26th April 2017. This data will be updated every 24 hours.