Automata presenting structures: A survey of the finite string case

Bulletin of Symbolic Logic

Volumn 14, Issue 2, 2008, Pages 169-209

  Rubin, Sasha ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44949169804     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1208442827     Document Type: Article

References (58)

1. C. J. ASH and A. NERODE, Intrinsically recursive relations, Aspects of effective algebra (clayton, 1979), Upside Down A Book Co., Yarra Glen, 1981, pp. 26-41.
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. 289-300.
3. _ , Automatic presentations of infinite structures, Ph.D. thesis, RWTH Aachen, 2007.
4. V. BÁRÁNY, L. KAISER, and S. RUBIN, Countable omega-automatic structures and their presentations, STACS 2008 (S. Albers, P. Weil, and C. Rochange, editors), Dagstuhl Seminar Proceedings, vol. 08001, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2008.
5. M. BENEDIKT and L. LIBKIN, Tree extension algebras: logics, automata, and query languages, LICS 2002, IEEE Computer Society, 2002, pp. 203-212.
6. M. BENEDIKT, L. LIBKIN, T. SCHWENTICK, and L. SEGOUFIN, A model-theoretic approach to regular string relations, LICS 2001, IEEE Computer Society, 2001, pp. 431-440.
7. C. H. BENNETT, Logical reversibility of computation, IBM Journal of Research and Development, vol. 17 (1973), no. 6, pp. 525-532.
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.
9. A. BLUMENSATH, Automatic structures, Diploma thesis, RWTH Aachen, 1999.
10. _ , Prefix-recognisable graphs and monadic second-order logic, Technical report, RWTH Aachen, 2001.
11. _ , Axiomatising tree-interpretable structures, STACS 2002 (H. Alt and A. Ferreira, editors), Lecture Notes in Computer Science, vol. 2285, Springer, 2002, pp. 596-607.
12. A. BLUMENSATH and E. GRÄDEL, Automatic structures, LICS 2000, IEEE Computer Society, 2000, pp. 51-62.
13. _ , Finite presentations of infinite structures: Automata and interpretations, Proceedings of the 2nd International Workshop on Complexity in Automated Deduction, CiAD 2002, 2002.
14. _ , Finite presentations of infinite structures: Automata and interpretations, Theory of Computing Systems, vol. 37 (2004), pp. 641-674.
15. V. BRUYÈRE, G. HANSEL, C. MICHAUX CHRISTIAN, and R. VILLEMAIRE, Logic and p-recognizable sets of integers, Bulletin of the Belgian Mathematical Society. Simon Stevin, vol. 1 (1994), no. 2, pp. 191-238, Journées Montoises (Mons, 1992).
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. 66-92.
17. _ , On a decision method in restricted second order arithmetic, Logic, methodology and philosophy of science, Stanford University Press, 1962, pp. 1-11.
18. J. W CANNON, The combinatorial structure of cocompact discrete hyperbolic groups, Geometriae Dedicata (Historical Archive), vol. 16 (1984), no. 2, pp. 123-148.
19. J. W. CANNON, D. B. H. EPSTEIN, D. F. HOLT, S. V. F. LEVY, M. S. PATERSON, and W. P. THURSTON, Word processing in groups, Jones and Bartlett, 1992.
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. 381-513.
21. T. COLCOMBET and C. LÖDING, Transforming structures by set interpretations, Technical Report AIB-2006-07. RWTH Aachen. 2006.
22. ω, 2001, manuscript.
23. _ , The Rado graph is not automatic, 2001, manuscript.
24. _ , Automaticité des ordinaux et des graphes homogènes, Comptes Rendus Mathematique, vol. 339 (2004), no. 1, pp. 5-10.
25. J. DONER, Tree acceptors and some of their applications, Journal of Computer and System Sciences, vol. 4 (1970), pp. 406-451.
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. 447-464.
27. C. C. ELGOT, Decision problems of finite automata design and related arithmetics, Transactions of the American Mathematical Society, vol. 98 (1961), pp. 21-51.
28. S. S. GONCHAROV and J. F. KNIGHT, Computable structure and non-structure theorems, Algebra and Logic, vol. 41 (2002), no. 6, pp. 351-373.
29. L. HELLA, Definability hierarchies of generalized quantifiers, Annals of Pure and Applied Logic, vol. 43 (1989), no. 3, pp. 235-271.
30. B. R. HODGSON, Théories décidables par automate fini, Ph.D. thesis, University of Montréal, 1976.
31. _ , On direct products of automaton decidable theories, Theoretical Computer Science, vol. 19 (1982), pp. 331-335.
32. _ , Decidabilite par automate fini, Annales de Sciences Mathématiques du Québec, vol. 7 (1983), pp. 39-57.
33. D. F. HOLT, The Warwick automatic groups software, Geometric and computational perspectives on infinite groups (Minneapolis, MN and New Brunswick, NJ, 1994), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 25, American Mathematical Society, 1996, pp. 69-82.
34. B. KHOUSSAINOV and A. NERODE, Automatic presentations of structures, Lecture Notes in Computer Science, vol. 960, 1995.
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.
36. B. KHOUSSAINOV. S. RUBIN, and F. STEPHAN, Definability and regularity in automatic structures, STACS 2004 (V. Diekert and M. Habib, editors), Lecture Notes in Computer Science, vol. 2996. Springer, 2004, pp. 440-451.
37. _ , Automatic linear orders and trees, ACM Transactions on Computational Logic, vol. 6 (2005), no. 4, pp. 675-700.
38. D. KUSKE, Is Cantor's theorem automatic?, LPAR 2003 (M. Y. Vardi and A. Voronkov, editors), Lecture Notes in Artificial Intelligence, vol. 2850, Springer, 2003, pp. 332-345.
39. D. KUSKE and M. LOHREY, First-order and counting theories of omega-automatic structures, Fakultätsbericht Nr. 2005/07. Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, September 2005.
40. L. LIBKIN and F. NEVEN, Logical definability and query languages over unranked trees, LICS 2003, IEEE Computer Society, 2003, pp. 178-187.
41. PER LINDSTRÖM, First order predicate logic with generalized quantifiers, Theoria, vol. 32 (1966), pp. 186-195.
42. CHRISTOF LÖDING, Infinite graphs generated by tree rewriting, Ph.D. thesis, RWTH Aachen, 2003.
43. M. LOHREY, Automatic structures of bounded degree, LPAR 2003 (M. Y. Vardi and A. Voronkov, editors), Lecture Notes in Artificial Intelligence, vol. 2850, Springer, 2003. pp. 344-358.
44. k> , Comptes Rendus des Séances de l'Académie des Sciences. Série I. Mathématique, vol. 303 (1986), no. 19, pp. 939-942.
45. A. A. NABEBIN, Multitape automata in a unary alphabet, Trudy Moskovskogo Ordena Lenina Ènergeticheskogo Instituta, vol. 292 (1976), pp. 7-11.
46. A. NIES, Describing Groups, this BULLETIN, vol. 13 (2007), no. 3, pp. 305-339.
47. A. NIES and R. THOMAS, FA-presentable groups and rings, 2005, to appear.
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. 1-35.
50. J. G. ROSENSTEIN, Linear orderings, Academic Press, 1982.
51. S. RUBIN, Automatic structures, Ph.D. thesis, University of Auckland, 2004.
52. F. STEPHAN, The random graph is not automatically presentable, 2002, manuscript.
53. A. SZILARD, S. YU, K. ZHANG, and J. SHALLIT, Characterizing regular languages with polynomial densities, MFCS '92 (I. M. Havel and V. Koubek, editors), Lecture Notes in Computer Science, vol. 629, Springer, 1992, pp. 494-503.
54. J. W. THATCHER and J. B. WRIGHT, Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory, vol. 2 (1968), pp. 57-81.
55. W. THOMAS, Automata on infinite objects, Handbook of theoretical computer science (J. van Leeuwen, editor), vol. B: Formal models and semantics, Elsevier, 1990, pp. 133-191.
56. B. A. TRAHTENBROT, Finite automata and the logic of one-place predicates. Russian, Siberian Mathematical Journal, vol. 3 (1962), pp. 103-131,
57. English translation: American Mathematical Society Translations, Series 2, vol. 59 (1966), pp. 23-55.
58. l> is undecidable, Theoretical Computer Science, vol. 106 (1992), pp. 337-349.