Academia.eduAcademia.edu

Outline

Title
Abstract
Higher-Order Data Structures
References

Automata-based presentations of infinite structures

Profile image of Vince BárányVince Bárány

2011, Finite and Algorithmic Model Theory (volume 379 of London Mathematical Society Lecture Notes Series)

Abstract
sparkles

AI

The paper explores automata-based presentations of infinite structures, focusing on the connection between finite model theory and algorithmic model theory. It addresses the challenges and methodologies for extending logical frameworks from finite to infinite structures, particularly in the domains of databases and verification. Central to this study is the requirement for decidable model checking problems for finitely presented infinite structures, as well as a systematic approach to the effective evaluation of logical formulae.

Related papers

Finite-model theory - a personal perspective
Ronald Fagin

Theoretical Computer Science, 1993

Fagin. R., Finite-mode1 theory -a personal perspective, Theoretical Computer Science 116 (1993) 3-31.

View PDFchevron_right
Approximating the Expressive Power of Logics in Finite Models
Argimiro Arratia

Lecture Notes in Computer Science, 2004

We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order formula) which, on the one hand, captures uniform circuit classes such as AC 0 and TC 0 over arithmetic models, namely, finite structures with linear order and arithmetic relations, and, on the other hand, their semantics, with respect to our arithmetic models, can be closely approximated by giving interpretations of their formulas on finite structures where all relations (including the order) are restricted to be "modular" (i.e. to act subject to an integer modulo). In order to give a precise measure of the proximity between satisfaction of a formula in an arithmetic model and satisfaction of the same formula in the "approximate" model, we define the approximate formulas and work on a notion of approximate truth. We also indicate how to enhance the expressive power of our probability logic in order to capture polynomial time decidable queries, There are various motivations for this work. As of today, there is not known logical description of any computational complexity class below NP which does not requires a built-in linear order. Also, it is widely recognized that many model theoretic techniques for showing definability in logics on finite structures become almost useless when order is present. Hence, if we want to obtain significant lower bound results in computational complexity via the logical description we ought to find ways of by-passing the ordering restriction. With this work we take steps towards understanding how well can we approximate, without a true order, the expressive power of logics that capture complexity classes on ordered structures.

View PDFchevron_right
Finite Presentations of Infinite Structures: Automata and Interpretations
Erich Grädel

Theory of Computing Systems, 2004

We study definability problems and algorithmic issues for infinite structures that are finitely presented. After a brief overview over different classes of finitely presentable structures, we focus on structures presented by automata or by model-theoretic interpretations. These two ways of presenting a structure are related. Indeed, a structure is automatic if, and only if, it is first-order interpretable in an appropriate expansion of Presburger arithmetic or, equivalently, in the infinite binary tree with prefix order and equal length predicate. Similar results hold for ω-automatic structures and appropriate expansions of the real ordered group. We also discuss the relationship to automatic groups.

View PDFchevron_right
1 Definability in classes of finite structures
Charles Steinhorn

2011

This paper provides an overview of recent work by the authors and others on two topics in the model theory of finite structures. The point of view here differs from that usually associated with the term ‘finite model theory’, as presented for example in [21] or [46], in which the emphasis and motivation come primarily from computer science. Instead, the inspiration for this work has its origins in contemporary (infinite) model theoretic themes such as dimension, independence, and various measures of the complexity of definable sets. Each of the topics deals with classes of finite structures for first-order logic that are isolated by conditions that are drawn from these model-theoretic considerations. Moreover, in both cases, connections exist to areas in infinite model theory such as stability and simplicity theory, and o-minimality. This survey is intended for both mathematical logicians and computer scientists whose work focuses on logical aspects of the subject. The first theme c...

View PDFchevron_right
Denability on !-Automatic Structures
Faried Abu Zaid

2011

View PDFchevron_right
Decidability and the finite model property
Alasdair Urquhart

Journal of Philosophical Logic, 1981

View PDFchevron_right
Computability and complexity properties of automatic structures and their applications
anil nerode

2008

Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend themselves well to real-time computations and efficient algorithms. Continuing a tradition of studying computability in mathematics, we examine automatic structures, mathematical objects which can be represented by automata, and apply resulting observations to computer science. We measure the complexity of automatic structures via well-established concepts from model theory, topology, and set theory. We prove the following results. The ordinal height of any automatic well-founded partial order is bounded by ω ω. The ordinal heights of automatic well-founded relations are unbounded below ω CK 1 , the first uncomputable ordinal. For any computable ordinal α, there is an automatic structure of Scott rank at least α. Moreover, there are automatic structures of Scott rank ω CK 1 , ω CK 1 + 1. For any computable ordinal α, there is an automatic successor tree of Cantor-Bendixson rank α. Next, we study infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations have finite degree and can be described by finite automata over a one-letter alphabet. We investigate algorithmic properties of such graphs in terms of their finite presentations. In particular, we ask how hard it is to check whether a given node belongs to an infinite component, whether two given nodes in the graph are reachable from one another, and whether the graph is connected. We give polynomial-time algorithms answering each of these questions. For a fixed input graph, the algorithm for infinite component membership works in constant time and reachability is decided uniformly by a single automaton. Hence, we improve on previous work, in which nonelementary or nonuniform algorithms were found. We turn our attention to automata techniques for deciding first-order logical theories. These techniques are useful in Integer Linear Programming and Mixed Integer Linear Programming, which in turn have applications in diverse areas of computer science and engineering. We extend known work to address the enumeration problem for linear programming solutions. Then, we apply a similar paradigm to give an automata theoretic decision procedure for the p-adic valued ring under addition and for formal Laurent series over a finite field with valuation and addition. BIOGRAPHICAL SKETCH Mor Minnes was born in Haifa, Israel in 1982. From an early age, Mor learned the importance of words and education: in the bath, Mor's parents (both students at the time) saw her and her sister typing intently on imaginary typewriters and proclaiming that they were working. In 1989, the nuclear family (now also including two brothers) moved to Vancouver, Canada for what was intended as a short visit for Mor's father to do a residency in psychiatry. Quickly, Mor became Mia, choosing a more suitable English name at the suggestion of her maternal grandmother. The family settled in Vancouver and Mia attended Prince of Wales Mini School and the International Baccalaureate Program at Sir Winston Churchill Secondary School. While in high school, Mia enjoyed both the sciences and the humanities. Not willing to give up either of these, Mia decided to pursue dual Bachelor's degrees at Queen's University in Kingston, Ontario. In 1999, Mia headed to snowy Kingston and enrolled in Applied Science (Mathematics & Engineering, Computing and Communications) and Philosophy. Mia had her first encounter with programming and fell in love with the power behind logical thinking. Considering graduate studies, logic was a natural fit with Mia's interests as it lay in the intersection of her favourite philosophy courses (philosophy of language and science) and engineering courses (computer architecture, programming, and math). Her best friend compiled a list of graduate programs in logic and Mia started browsing through their websites. When she discovered Anil Nerode's research outlining connections between automata, logic, and hybrid systems, she knew she had found what she wanted to work on. Mia graduated from Queen's and headed south to Ithaca, NY to begin graduate school in mathematics at Cornell University, along the way also earning a Master's degree in computer science. After five years of graduate school, Mia is looking forward to being a C.L.E. Moore Instructor at MIT next year.

View PDFchevron_right
Unifying Themes in Finite Model Theory
Erich Grädel

Texts in Theoretical Computer Science an EATCS Series, 2007

One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of pattern, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It is this aspect of logic which is most prominent in model theory, "the branch of mathematical logic which deals with the relation between a formal language and its interpretations" . No wonder, then, that mathematical logic, in general, and finite model theory, the specialization of model theory to finite structures, in particular, should find manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure.

View PDFchevron_right
Logic and Games on Automatic Structures
Łukasz Kaiser

The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it is false. This correspondence has been known for a very long time and has inspired numerous research directions. In this book, the author extends this connection between logic and games to the class of automatic structures, where relations are recognized by synchronous finite automata. In model-checking games for automatic structures, two coalitions play against each other with a particular kind of hierarchical imperfect information. The investigation of such games leads to the introduction of a game quantifier on automatic structures, which connects alternating automata with the classical model-theoretic notion of a game quantifier. This study is then extended, determining the memory needed for strategies in infinitary games on the one hand, and characterizing regularity-preserving Lindstrom quantifiers on the other. Counting quantifiers are investigated in depth: it is shown that all countable omega-automatic structures are in fact finite-word automatic and that the infinity and uncountability set quantifiers are definable in MSO over countable linear orders and over labeled binary trees. This book is based on the PhD thesis of Lukasz Kaiser, which was awarded with the E.W. Beth award for outstanding dissertations in the fields of logic, language, and information in 2009. The work constitutes an innovative study in the area of algorithmic model theory, demonstrating the deep interplay between logic and computability in automatic structures. It displays very high technical and presentational quality and originality, advances significantly the field of algorithmic model theory and raises interesting new questions, thus emerging as a fruitful and inspiring source for future research.

View PDFchevron_right
Infinitary Logic and Inductive Definability over Finite Structures
Steven Lindell

Information and Computation, 1995

The extensions of first-order logic with a least fixed point operator (FO + LFP) and with a partial fixed point operator (FO + PFP) are known to capture the complexity classes P and PSPACE respectively in the presence of an ordering relation over finite structures. Recently, Abiteboul and Vianu [AVSlb] investigated the relationship of these two logics in the absence of an ordering, using a machine model of generic computation. In particular, they showed that the two languages have equivalent expressive power if and only if P = PSPACE. These languages can also be seen as fragments of an infinitary logic where each formula has a bounded number of variables, LW,, (see, for instance, [KVSO]). We present a treatment of the results in [AVSlb] from this point of view. In particular, we show that we can write a formula of FO + LFP that defines an ordering of the L; , types uniformly over all finite structures. One consequence of this is a generalization of the equivalence of FO + LFP and P from ordered structures to classes of structures where every element is definable. We also settle a conjecture mentioned in [AVSlb] by showing that FO + LFP is properly contained in the polynomial time computable fragment of LW,,, raising the question of whether the latter fragment is a recursively enumerable class.

View PDFchevron_right

References (140)

  1. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. Safety is not a restriction at level 2 for string languages. In FoSSaCS, pages 490-504, 2005.
  2. J.-P. Allouche and J. Shallit. Automatic Sequences, Theory, Applications, Generalizations. Cambridge University Press, 2003.
  3. J.-P. Allouche and J. O. Shallit. The Ubiquitous Prouhet-Thue-Morse Sequence. In C. Ding, T. Helleseth, and H. Niederreiter, editors, Sequences and Their Applications: Proceedings of SETA '98, pages 1-16. Springer- Verlag, 1999.
  4. V. Bárány. A hierarchy of automatic ω-words having a decidable MSO theory. Journées Montoises '06, Rennes, 2006.
  5. V. Bárány. Invariants of automatic presentations and semi-synchronous transductions. In STACS '06, volume 3884 of LNCS, pages 289-300, 2006.
  6. V. Bárány. Automatic Presentations of Infinite Structures. Phd thesis, RWTH Aachen University, 2007.
  7. V. Bárány. A hierarchy of automatic ω-words having a decidable MSO theory. R.A.I.R.O. Theoretical Informatics and Applications, 42:417-450, 2008.
  8. V. Bárány. Semi-synchronous transductions. Acta Informatica, 46(1):29- 42, 2009.
  9. V. Bárány, L. Kaiser, and A. Rabinovich. Eliminating cardinality quanti- fiers from MLO. Manuscript, 2007.
  10. V. Bárány, Ch. Löding, and O. Serre. Regularity problems for visibly pushdown languages. In STACS '06, volume 3884 of LNCS, pages 420- 431, 2006.
  11. K. Barthelmann. On equational simple graphs. Tech. Rep. 9, Universität Mainz, Institute für Informatik, 1997.
  12. K. Barthelmann. When can an equational simple graph be generated by hyperedge replacement? In MFCS, pages 543-552, 1998.
  13. M.-P. Béal and D. Perrin. Symbolic Dynamics and Finite Automata. In A. Salomaa and G. Rosenberg, editors, Handbook of Formal Languages, Vol. 2, pages 463-503. Springer Verlag, 1997.
  14. M. Benedikt and L. Libkin. Tree extension algebras: logics, automata, and query languages. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 203-212, 2002.
  15. M. Benedikt, L. Libkin, Th. Schwentick, and L. Segoufin. A model- theoretic approach to regular string relations. In Joseph Halpern, editor, LICS 2001, pages 431-440. IEEE Computer Society, June 2001.
  16. M. Benedikt, L. Libkin, Th. Schwentick, and L. Segoufin. Definable rela- tions and first-order query languages over strings. J. ACM, 50(5):694-751, 2003.
  17. D. Berwanger and A. Blumensath. The monadic theory of tree-like struc- tures.
  18. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logics, and Infinite Games, number 2500 in LNCS, chapter 16, pages 285-301. Springer Verlag, 2002.
  19. A. Bès. Undecidable extensions of Büchi arithmetic Cobham-Semënov theorem. Journal of Symbolic Logic, 62(4):1280-1296, 1997.
  20. A. Bés. An Extension of the Cobham-Semënov Theorem. J. of Symb. Logic, 65(1):201-211, 2000.
  21. A. Blumensath. Automatic Structures. Diploma thesis, RWTH-Aachen, 1999.
  22. A. Blumensath. Prefix-Recognisable Graphs and Monadic Second-Order Logic. Technical report AIB-2001-06, RWTH Aachen, 2001.
  23. A. Blumensath. Axiomatising Tree-interpretable Structures. In STACS, volume 2285 of LNCS, pages 596-607. Springer-Verlag, 2002.
  24. A. Blumensath, Th. Colcombet, and Ch. Löding. Logical theories and compatible operations. In J. Flum, E. Grädel, and T. Wilke, editors, Logic and Automata: History and Perspectives, Texts in Logic and Games, pages 73-106. Amsterdam University Press, 2007.
  25. A. Blumensath and E. Grädel. Automatic structures. In LICS 2000, pages 51-62. IEEE Computer Society, 2000.
  26. A. Blumensath and E. Grädel. Finite presentations of infinite structures: Automata and interpretations. Theory of Comp. Sys., 37:641 -674, 2004.
  27. V. Bruyère, G. Hansel, Ch. Michaux, and R. Villemaire. Logic and p- recognizable sets of integers. Bull. Belg. Math. Soc., 1:191 -238, 1994.
  28. J. R. Büchi. Weak second-order arithmetic and finite automata. Zeit. Math. Logih Grund. Math., 6:66-92, 1960.
  29. A. J. Cain, E. F. Robertson, and N. Ruskuc. Subsemigroups of groups: presentations, malcev presentations, and automatic structures. Journal of Group Theory, 9(3):397-426, 2006.
  30. C. M. Campbell, E. F. Robertson, N. Ruskuc, and R. M. Thomas. Auto- matic semigroups. Theor. Comput. Sci., 250(1-2):365-391, (2001).
  31. C. M. Campbell, E. F. Robertson, N. Ruskuc, and R. M. Thomas. Au- tomatic completely-simple semigroups. Acta Math. Hungar., 96:201-215, 2002.
  32. J.W. Cannon, D.B.A. Epstein, D.F. Holt, S.V.F. Levy, M.S. Paterson, and W.P. Thurston. Word processing in groups. Jones and Barlett Publ., Boston, MA, 1992.
  33. A. Carayol. Regular sets of higher-order pushdown stacks. In Proceedings of Mathematical Foundations of Computer Science (MFCS 2005), volume 3618 of LNCS, pages 168-179, 2005.
  34. A. Carayol and Th. Colcombet. On equivalent representations of infinite structures. In ICALP, volume 2719 of pages 599-610. Springer, 2003.
  35. A. Carayol and A. Meyer. Linearly bounded infinite graphs. In MFCS, vol- ume 3618 of Lecture Notes in Computer Science, pages 180-191. Springer, 2005.
  36. A. Carayol and A. Meyer. Context-Sensitive Languages, Rational Graphs and Determinism. Logical Methods in Computer Science, 2(2), 2006.
  37. A. Carayol and C. Morvan. On rational trees. In Z. Ésik, editor, CSL 06, volume 4207 of LNCS, pages 225-239, 2006.
  38. A. Carayol and S. Wöhrle. The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In FSTTCS, volume 2914 of LNCS, pages 112-123. Springer, 2003.
  39. O. Carton and W. Thomas. The monadic theory of morphic infinite words and generalizations. Information and Computation, 176(1):51-65, 2002.
  40. A. Caryol and Ch. Löding. MSO on the Infinite Binary Tree: Choice and Order. In CSL, volume 4646 of LNCS, pages 161-176, 2007.
  41. D. Caucal. Monadic theory of term rewritings. In LICS, pages 266-273. IEEE Computer Society, 1992.
  42. D. Caucal. On the regular structure of prefix rewriting. Theor. Comput. Sci., 106(1):61-86, 1992.
  43. D. Caucal. On infinite transition graphs having a decidable monadic the- ory. In ICALP'96, volume 1099 of LNCS, pages 194-205, 1996.
  44. D. Caucal. On infinite terms having a decidable monadic theory. In MFCS, pages 165-176, 2002.
  45. D. Caucal. Deterministic graph grammars. In J. Flum, E. Grädel, and T. Wilke, editors, Logic and Automata: History and Perspectives, Texts in Logic and Games, pages 169-250. Amsterdam University Press, 2007.
  46. D. Cenzer and J.B. Remmel. Complexity-theoretic model theory and al- gebra. In Handbook of Recursive Mathematics, Vol. 1, volume 138 of Stud- ies in Logic and the Foundations of Mathematics, pages 381-513. North- Holland, Amsterdam, 1998.
  47. Ch. Choffrut. A short introduction to automatic group theory, 2002.
  48. T. Colcombet and C. Löding. Transforming structures by set interpreta- tions. Logical Methods in Computer Science, 3(2), 2007.
  49. Th. Colcombet. On families of graphs having a decidable first order the- ory with reachability. In ICALP, volume 2380 of LNCS, pages 98-109. Springer, 2002.
  50. Th. Colcombet. Equational presentations of tree-automatic structures. In Workshop on Automata, Structures and Logic, Auckland, NZ, 2004.
  51. Th. Colcombet. Propriétés et représentation de structures infinies. Thèse de doctorat, Université Rennes I, 2004.
  52. Th. Colcombet. A combinatorial theorem for trees. In ICALP, volume 4596 of LNCS, pages 901-912. Springer, 2007.
  53. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. In prepa- ration, draft available online at http://www.grappa.univ-lille3.fr/tata/.
  54. B. Courcelle. Graph algebras and monadic second-order logic. Cambridge University Press, in writing...
  55. B. Courcelle. The definability of equational graphs in monadic second- order logic. In ICALP, volume 372 of LNCS, pages 207-221. Springer, 1989.
  56. B. Courcelle. Graph rewriting: An algebraic and logic approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pages 193-242. Elsevier and MIT Press, 1990.
  57. B. Courcelle. Recursive applicative program schemes. In J. v.d. Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 459-492. Elsevier and MIT Press, 1990.
  58. B. Courcelle. The monadic second-order logic of graphs ix: Machines and their behaviours. Theoretical Computer Science, 151(1):125-162, 1995.
  59. B. Courcelle. Finite model theory, universal algebra and graph grammars. In LFCS '97, Proceedings of the 4th International Symposium on Logi- cal Foundations of Computer Science, pages 53-55, London, UK, 1997. Springer-Verlag.
  60. B. Courcelle. The Expression of Graph Properties and Graph Transforma- tions in Monadic Second-Order Logic. In G. Rozenberg, editor, Handbook of graph grammars and computing by graph transformations, vol. 1: Foun- dations, pages 313-400. World Scientific, New-Jersey, London, 1997.
  61. B. Courcelle and J. A. Makowsky. Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. Mathematical Struc- tures in Computer Science, 12(2):203-235, 2002.
  62. B. Courcelle and I. Walukiewicz. Monadic second-order logic, graph cov- erings and unfoldings of transition systems. Annals of Pure and Applied Logic, 92:35-62, 1998.
  63. W. Damm. The IO-and OI hierarchies. Theoretical Computer Science, 20(2):95-208, 1982.
  64. C. Delhommé. Automaticité des ordinaux et des graphes homogènes. Comptes Rendus Mathematique, 339(1):5-10, 2004.
  65. M.J. Dunwoody. The accessibility of finitely presented groups. Inventiones Mathematicae, 81(3):449-457, 1985.
  66. S. Eilenberg, C.C. Elgot, and J.C. Shepherdson. Sets recognised by n-tape automata. Journal of Algebra, 13(4):447-464, 1969.
  67. C. C. Elgot and J. E. Mezei. On relations defined by generalized finite automata. IBM J. Research and Development, 9:47 -68, 1965.
  68. C. C. Elgot and M. O. Rabin. Decidability and undecidability of exten- sions of second (first) order theory of (generalized) successor. Journal of Symbolic Logic, 31(2):169-181, 1966.
  69. C.C. Elgot. Decision problems of finite automata design and related arith- metics. Trans. Amer. Math. Soc., 98:21-51, 1961.
  70. J. Engelfriet. Context-free graph grammars. In Handbook of formal lan- guages, vol. III, pages 125-213. Springer-Verlag New York, Inc., New York, NY, USA, 1997.
  71. Y.L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel, editors. Hand- book of Recursive Mathematics, Vol. 1, volume 138 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1998.
  72. B. Farb. Automatic Groups: A Guided Tour. L'Enseignment Math., 38:291-313, 1992.
  73. S. Fratani. Automates à Piles de Piles ... de Piles. Thèse de doctorat, Université Bordeaux 1, 2005.
  74. S. Fratani. Regular sets over tree structures. Rapport Interne 1358-05, LaBRI, Université Paris 7, 2005.
  75. S. Fratani. The theory of successor extended by severals predicates. Journées Montoises '06, Rennes, 2006.
  76. S. Fratani and G. Sénizergues. Iterated pushdown automata and sequences of rational numbers. Ann. Pure Appl. Logic, 141(3):363-411, 2006.
  77. Ch. Frougny. Numeration systems. In M. Lothaire, editor, Algebraic Combinatorics on Words. Cambridge University Press, 2002.
  78. E. Grädel. Simple interpretations among complicated theories. Informa- tion Processing Letters, 35:235-238, 1990.
  79. E. Grädel, P. G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Vardi, Y. Venema, and S. Weinstein. Finite Model Theory and Its Applications. Springer-Verlag, 2007.
  80. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games, volume 2500 of LNCS. Springer-Verlag, 2002.
  81. A. Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer, 1992.
  82. M. Hague, A.S. Murawski, C.-H. L. Ong, and O. Serre. Collapsible push- down automata and recursion schemes. In LICS'08. IEEE Computer So- ciety, 2008.
  83. G. Hjorth, B. Khoussainov, A. Montalbán, and A. Nies. From automatic structures to Borel structures. In 23rd Symposium on Logic in Computer Science (LICS), 2008.
  84. M. Hoffmann, D. Kuske, F. Otto, and R. M. Thomas. Some relatives of automatic and hyperbolic groups, 2002.
  85. M. Hoffmann and R. M. Thomas. Notions of automaticity in semigroups. Semigroup Forum, 66:337-367., (2003).
  86. L. Kaiser, S. Rubin, and V. Bárány. Cardinality and counting quantifiers on ω-automatic structures. In STACS '08, volume 08001 of Dagstuhl Seminar Proceedings, pages 385-396. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2008.
  87. B. Khoussainov and M. Minnes. Model theoretic complexity of automatic structures. Annals of Pure and Applied Logic, To appear, 2008.
  88. B. Khoussainov and A. Nerode. Automatic presentations of structures. In LCC '94, volume 960 of LNCS, pages 367-392. Springer-Verlag, 1995.
  89. B. Khoussainov, A. Nies, S. Rubin, and F. Stephan. Automatic structures: Richness and limitations. In LICS'04, pages 44-53, 2004.
  90. B. Khoussainov and S. Rubin. Graphs with automatic presentations over a unary alphabet. Journal of Automata, Languages and Combinatorics, 6(4):467-480, 2001.
  91. B. Khoussainov, S. Rubin, and F. Stephan. Definability and regularity in automatic structures. In STACS '04, volume 2996 of LNCS, pages 440-451, 2004.
  92. B. Khoussainov, S. Rubin, and F. Stephan. Automatic linear orders and trees. ACM Transactions on Computational Logic, 6(4):675-700, 2005.
  93. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS'02, volume 2303 of LNCS, pages 205-222, 2002.
  94. D. Kuske. Is cantor's theorem automatic? In LPAR, volume 2850 of LNCS, pages 332-345. Springer, 2003.
  95. D. Kuske and M. Lohrey. First-order and counting theories of ω-automatic structures. In FoSSaCS, pages 322-336, 2006.
  96. D. Kuske and M. Lohrey. Automatic structures of bounded degree revis- ited. arXiv:0810.4998, 2008.
  97. D. Kuske and M. Lohrey. Hamiltonicity of automatic graphs. In FIP TCS 2008, 2008.
  98. H. Lauchli and Ch. Savioz. Monadic Second Order Definable Relations on the Binary Tree. J. of Symbolic Logic, 52(1):219-226, 1987.
  99. S. Lifsches and S. Shelah. Uniformization and skolem functions in the class of trees. Journal of Symbolic Logic, 63:103-127, 1998.
  100. Ch. Löding. Infinite Graphs Generated by Tree Rewriting. Doctoral thesis, RWTH Aachen, 2003.
  101. Christof Löding. Reachability problems on regular ground tree rewriting graphs. Theor. Comp. Sys., 39(2):347-383, 2006.
  102. M. Lohrey. Automatic structures of bounded degree. In LPAR, volume 2850 of LNCS, pages 346-360. Springer, 2003.
  103. M. Lohrey. Decidability and complexity in automatic monoids. In Devel- opments in Language Theory, pages 308-320, 2004.
  104. A. Meyer. Traces of term-automatic graphs. R.A.I.R.O. Theoretical In- formatics and Applications, 42, 2008.
  105. C. Michaux and F. Point. Les ensembles k-reconnaissables sont définissables dans N, +, V k . C. R. Acad. Sci. Paris Sér. I Math., 303(19):939-942, 1986.
  106. Ch. Morvan. Les graphes rationnels. Thèse de doctorat, Université de Rennes 1, Novembre 2001.
  107. Ch. Morvan. Classes of rational graphs. Journées Montoises '06, Rennes, 2006.
  108. Ch. Morvan and Ch. Rispal. Families of automata characterizing context- sensitive languages. Acta Informatica, 41(4-5):293-314, 2005.
  109. Ch. Morvan and C. Stirling. Rational graphs trace context-sensitive lan- guages.
  110. In A. Pultr and J. Sgall, editors, MFCS 01, volume 2136 of LNCS, pages 548-559, 2001.
  111. A. A. Muchnik. The definable criterion for definability in Presburger arithmetic and its applications. Theor. Comput. Sci., 290(3):1433-1444, 2003. D. E. Muller and P. E. Schupp. Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems. Bull. Amer. Math. Soc., 4(3):331-334, 1981.
  112. D. E. Muller and P. E. Schupp. Groups, the theory of ends, and context- free languages. J. Comput. Syst. Sci., 26(3):295-310, 1983.
  113. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sci., 37:51-75, 1985.
  114. A. A. Nabebin. Expressibility in a restricted second-order arithmetic. Siberian Mathematical Journal, 18(4):588-593, 1977.
  115. A. Nies. Describing groups. Bulletin of Symbolic Logic, 13(3):305-339, 2007.
  116. D. Niwiński. On the cardinality of sets of infinite trees recognizable by finite automata. In Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS'91, volume 520, pages 367-376. Springer, 1991.
  117. G. P. Oliver and R. M. Thomas. Finitely generated groups with automatic presentations. In STACS 2005, volume 3404 of LNCS, pages 693-704. Springer, 2005.
  118. C.-H. L. Ong. On model-checking trees generated by higher-order recur- sion schemes. In LICS, pages 81-90. IEEE Computer Society, 2006.
  119. J.-J. Pansiot. On various classes of infinite words obtained by iterated mappings. In Automata on Infinite Words, pages 188-197, 1984.
  120. A. Rabinovich. On decidability of monadic logic of order over the naturals extended by monadic predicates. Unpublished note, 2005.
  121. A. Rabinovich and W. Thomas. Decidable theories of the ordering of natural numbers with unary predicates. Submitted, 2006.
  122. M. Rigo. Numeration systems on a regular language: Arithmetic op- erations, recognizability and formal power series. Theoretical Computer Science, 269:469, 2001.
  123. M. Rigo and A. Maes. More on generalized automatic sequences. J. of Automata, Languages and Combinatorics, 7(3):351-376, 2002.
  124. Ch. Rispal. The synchronized graphs trace the context-sensistive lan- guages. Electronic Notes in Theor. Comp. Sci., 68(6), 2002.
  125. S. Rubin. Automatic Structures. Phd thesis, University of Auckland, NZ, 2004.
  126. S. Rubin. Automata presenting structures: A survey of the finite-string case. Bulletin of Symbolic Logic, 14(2):169-209, 2008.
  127. A. L. Semenov. Decidability of monadic theories. In Mathematical Foun- dations of Computer Science, Prague, 1984, volume 176 of LNCS, page 162?175. Springer, Berlin, 1984.
  128. G. Sénizergues. Semi-groups acting on context-free graphs. In ICALP '96: Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, pages 206-218, London, UK, 1996. Springer-Verlag.
  129. G. Sénizergues. The bisimulation problem for equational graphs of finite out-degree. SIAM J. Comput., 34(5):1025-1106, 2005.
  130. P. V. Silva and B. Steinberg. A geometric characterization of automatic monoids. The Quarterly Journal of Mathematics, 55:333-356, 2004.
  131. J. Su and S. Grumbach. Finitely representable databases (extended ab- stract. In In Proc. 13th ACM Symp. on Principles of Database Systems, 1994.
  132. A. Szilard, Sh. Yu, K. Zhang, and J. Shallit. Characterizing regular lan- guages with polynomial densities. In MFCS, pages 494-503, 1992.
  133. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pages 133-192. Elsevier and MIT Press, 1990.
  134. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Sa- lomaa, editors, Handbook of Formal Languages, volume III, pages 389-455. Springer, New York, 1997.
  135. W. Thomas. Constructing Infinite Graphs with a Decidable MSO-Theory. In MFCS, volume 2747 of LNCS, pages 113-124, 2003.
  136. B.A. Trahtenbrot. Finite automata and the logic of one-place predicates. Russian. Siberian Mathematical Journal, 3:103-131, 1962. English trans- lation: American Mathematical Society Translations, Series 2, 59 (1966), 23-55.
  137. T. Tsankov. The additive group of the rationals is not automatic. manuscript, 2009.
  138. R. Villemaire. The theory of N, +, V k , V l is undecidable. Theoretical Computer Science, 106:337-349, 1992.
  139. I. Walukiewicz. Monadic second-order logic on tree-like structures. The- oretical Computer Science, 275:311-346, 2002.
  140. S. Wöhrle and W. Thomas. Model checking synchronized products of infinite transition systems. In LICS '04, pages 2-11, Washington, DC, USA, 2004. IEEE Computer Society.

Related papers

1 Automata-based presentations of infinite structures
Vince Bárány

2010

The model theory of finite structures is intimately connected to various fields in computer science, including complexity theory, databases, and verification. In particular, there is a close relationship between complexity classes and the expressive power of logical languages, as witnessed by the fundamental theorems of descriptive complexity theory, such as Fagin's Theorem and the Immerman-Vardi Theorem (see [78, Chapter 3] for a survey). However, for many applications, the strict limitation to finite structures has turned out to be too restrictive, and there have been considerable efforts to extend the relevant logical and algorithmic methodologies from finite structures to suitable classes of infinite ones. In particular this is the case for databases and verification where infinite structures are of crucial importance [130]. Algorithmic model theory aims to extend in a systematic fashion the approach and methods of finite model theory, and its interactions with computer science, from finite structures to finitely-presentable infinite ones. There are many possibilities to present infinite structures in a finite manner. A classical approach in model theory concerns the class of computable structures; these are countable structures, on the domain of nat

View PDFchevron_right
Computable model theory
Valentina Harizanov

Developments from Turing's Ideas in Logic, 2009

Introduction and preliminaries. 2. Degrees and jump degrees of structures and their isomorphism types. 3. Theories, types, models, and diagrams. 4. Small theories and their models. 5. Effective categoricity. 6. Automorphisms of effective structures. 7. Degree spectra of relations. 8. Families of relations on a structure. 9. Classes of structures and equivalence relations.

View PDFchevron_right
Algorithmic Solutions via Model Theoretic Interpretations
Faried Abu Zaid

2017

Model theoretic interpretations are an important tool in algorithmic model theory. Their applications range from reductions between logical theories to the construction of algorithms for problems, which are hard in general but efficiently solvable on restricted classes of structures, like 3-Colorability on graphs of bounded treewidth. We investigate this tool in three different areas of Algorithmic Model Theory: 1. automata-based decision procedures for logical theories, 2. algorithmic meta-theorems, and 3. descriptive complexity. One of the main focus points of this dissertation are automata based presentations of infinite objects, which are closely related to monadic second-order interpretations over set variables. We introduce automatic presentations with advice for several automata models. These are presentations where the automata have access to some fixed auxiliary information. We develop algebraic and combinatorial tools, which enable us to prove that certain structures canno...

View PDFchevron_right
On the Expressive Power of Logics on Finite Models
Erich Grädel

Texts in Theoretical Computer Science an EATCS Series, 2007

View PDFchevron_right
07441 Abstracts Collection--Algorithmic-Logical Theory of Infinite Structures}
Moshe Vardi

Abstract From 28.10. to 02.11. 2007, the Dagstuhl Seminar 07441``Algorithmic-Logical Theory of Infinite Structures''was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper.

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved