Automata with nested pebbles capture first-order logic with transitive closure

Logical Methods in Computer Science

Volumn 3, Issue 2, 2007, Pages

  Engelfriet, Joost ^a   Hoogeboom, Hendrik Jan ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

First order logic; Pebbles; Transitive closure; Tree walking automata

Indexed keywords

AUTOMATA THEORY; FORESTRY; FORMAL LOGIC; TREES (MATHEMATICS);

DETERMINISTIC AUTOMATA; FIRST ORDER LOGIC; MONADIC SECOND-ORDER LOGIC; NONDETERMINISTIC AUTOMATA; PEBBLES; STRING LANGUAGES; TRANSITIVE CLOSURE; TREE-WALKING AUTOMATON;

COMPUTER CIRCUITS;

EID: 77955340290     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(2:3)2007     Document Type: Article

References (66)

1. A.V. Aho, J.D. Ullman. Translations on a context free grammar, Information and Control 19, 439-475, 1971. doi:10.1016/S0019-9958(71)90706-6
2. Y. Bargury, J.A. Makowsky. The expressive power of transitive closure and 2-way multihead automata, in: Computer Science Logic, Proceedings 5th Workshop, CSL ’91 (E. Börger, et al., eds.), Lecture Notes in Computer Science 626, 1-14, 1992. doi:10.1007/BFb0023754
3. P. Beame, A. Borodin, P. Raghavan, W.L. Ruzzo, M. Tompa. A time-space tradeoff for undirected graph traversal by walking automata, SIAM Journal on Computing 28, 1051-1072, 1999. doi:10.1137/S0097539793282947
4. M. Blum, C. Hewitt. Automata on a 2-dimensional tape, in: Proceedings 8th IEEE Symposium on Switching and Automata Theory, 155-160, 1967.
5. M. Blum, D. Kozen. On the power of the compass (or, why mazes are easier to search than graphs), in: Proceedings 19th FOCS (Annual Symposium on Foundations of Computer Science), 132-142, 1978.
6. M. Bojańczyk. 1-Bounded TWA cannot be determinized, in: Proceedings 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS’03 (P.K. Pandya, J. Radhakrishnan, eds.), Lecture Notes in Computer Science 2914, 62-73, 2003. doi:10.1007/b94618
7. M. Bojańczyk, T. Colcombet. Tree-walking automata cannot be determinized, Theoretical Computer Science 350, 164-173, 2006. doi:10.1016/j.tcs.2005.10.031
8. M. Bojańczyk, T. Colcombet. Tree-walking automata do not recognize all regular languages, in: Proceedings 37th ACM Symposium on Theory of Computing, STOC’05 (H.N. Gabow, R. Fagin, eds.), 234-243, 2006. doi:10.1145/1060590.1060626
9. M. Bojańczyk, M. Samuelides, T. Schwentick, L. Segoufin. On the expressive power of pebble automata, in: Automata, Languages and Programming, 33rd International Colloquium, Proceedings Part I, ICALP ’06 (M. Bugliesi, B. Preneel, V. Sassone and I.Wegener, eds.), Lecture Notes in Computer Science 4051, 157-168, 2006. doi:10.1007/1178698615
10. A. Brüggemann-Klein, D. Wood. Caterpillars: A context specification technique, Markup Languages 2, 81-106, 2000.
11. J.R. Büchi. Weak second-order arithmetic and finite automata, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6, 66-92, 1960. doi:10.1002/malq.19600060105
12. L. Budach. Automata and labyrinths, Mathematische Nachrichten 86, 195-282, 1978.
13. B. ten Cate. The expressivity of XPath with transitive closure, in: Proceedings of the 25th ACM Symposium on Principles of Database Systems, PODS 2006, ACM Press, 328-337, 2006. doi:10.1145/1142351.1142398
14. S.A. Cook, C.W. Rackoff. Space lower bounds for maze threadability on restricted machines, SIAM Journal on Computing 9, 636-652, 1980. doi:10.1137/0209048
15. J. Doner. Tree acceptors and some of their applications, Journal of Computer and System Sciences 4, 406-451, 1970.
16. H.-D. Ebbinghaus, J. Flum. Finite Model Theory, second edition, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1999.
17. C.C. Elgot. Decision problems of finite automata design and related arithmetics, Transactions of the American Mathematical Society 98, 21-52, 1961.
18. J. Engelfriet. Context-free grammars with storage, Leiden University, Technical Report 86-11, 1986.
19. J. Engelfriet, H.J. Hoogeboom. Tree-walking pebble automata, in: Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa (J. Karhumäki et al., eds.), Springer-Verlag, 72-83, 1999.
20. J. Engelfriet, H.J. Hoogeboom. Nested pebbles and transitive closure, in: Proceedings 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006 (B. Durand, W. Thomas, eds.), Lecture Notes in Computer Science 3884, 477-488, 2006. doi:10.1007/1167214239
21. J. Engelfriet, H.J. Hoogeboom, J.-P. van Best. Trips on trees, Acta Cybernetica 14, 51-64, 1999.
22. J. Engelfriet, S. Maneth. A comparison of pebble tree transducers with macro tree transducers, Acta Informatica 39, 613-698, 2003. doi:10.1007/s00236-003-0120-0
23. J. Engelfriet, G. Rozenberg, G. Slutzki. Tree transducers, L systems, and two-way machines, Journal of Computer and System Sciences 20, 150-202, 1980. doi:10.1016/0022-0000(80)90058-6
24. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, D. Peleg. Graph exploration by a finite automaton, Theoretical Computer Science 345, 331-344, 2005. doi:10.1016/j.tcs.2005.07.014
25. D. Giammarresi, A. Restivo. Two-dimensional languages, in: Handbook of Formal Languages, Volume 3: Beyond Words (G. Rozenberg, A. Salomaa, eds.), Chapter 4, Springer-Verlag, 1997.
26. N. Globerman, D. Harel. Complexity results for two-way and multi-pebble automata and their logics, Theoretical Computer Science 169, 161-184, 1996. doi:10.1016/S0304-3975(96)00119-3
27. E. Goris, M. Marx. Looping caterpillars, in: Proceedings 20th IEEE Symposium on Logic in Computer Science, LICS 2005, IEEE, 51-60, 2005. doi:10.1109/LICS.2005.24
28. E. Grädel, G. McColm. On the power of deterministic transitive closure, Information and Computation 119, 129-135, 1995. doi:10.1006/inco.1995.1081
29. M. Grohe. Arity hierarchies, Annals of Pure and Applied Logic 82, 103-163, 1996. doi:10.1016/0168-0072(95)00072-0
30. J. Hartmanis. On non-determinancy in simple computing devices, Acta Informatica 1, 336-344, 1972. doi:10.1007/BF00289513
31. F. Hoffmann. One pebble does not suffice to search plane labyrinths, in: Fundamentals of Computation Theory, FCT’81 (F. Gécseg, ed.), Lecture Notes in Computer Science 117, 433-444, 1981.
32. O.H. Ibarra. Characterization of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata, Journal of Computer and System Sciences 5, 88-117, 1971.
33. N. Immerman. Languages that capture complexity classes, SIAM Journal on Computing 16, 760-778, 1987. doi:10.1137/0216051
34. N. Immerman. Nondeterministic space is closed under complementation, SIAM Journal on Computing 17, 935-938, 1988. doi:10.1137/0217058
35. N. Immerman. Descriptive Complexity, Graduate Texts in Computer Science, Springer-Verlag, New York, 1999.
36. T. Kamimura, G. Slutzki. Parallel and two-way automata on directed ordered acyclic graphs, Information and Control 49, 10-51, 1981. doi:10.1016/S0019-9958(81)90438-1
37. N. Klarlund, T. Schwentick, D. Suciu. XML: Model, Schemas, Types, Logics, and Queries, in: Logics for Emerging Applications of Databases (J. Chomicki, R. van der Meyden, G. Saake, eds.), Springer-Verlag, 1-41, 2004.
38. S. C. Kleene. Representation of events in nerve nets and finite automata, in: Automata Studies (C.E. Shannon, J. McCarthy, eds.), Princeton University Press, 3-41, 1956.
39. L. Libkin. Logics for unranked trees: an overview, Logical Methods in Computer Science 2, Issue 3, Paper 2, 2006. doi:10.2168/LMCS-2(3:2)2006
40. O. Matz. Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures, Theoretical Computer Science 270, 1-70, 2002. doi:10.1016/S0304-3975(01)00277-8
41. O. Matz, N. Schweikardt, W. Thomas. The monadic quantifier alternation hierarchy over grids and graphs, Information and Computation 179, 356-383, 2002. doi:10.1006/inco.2002.2955
42. R. McNaughton, H. Yamada. Regular expressions and state graphs for automata, IRE Transactions on Electronic Computers 9, 39-47, 1960.
43. T. Milo, D. Suciu, V. Vianu. Typechecking for XML transformers, Journal of Computer and System Sciences 66, 66-97, 2003. doi:10.1016/S0022-0000(02)00030-2
44. B. Monien. Two-way multihead automata over a one-letter alphabet, RAIRO-Informatique Théorique et Applications 14, 67-82, 1980.
45. A. Muscholl, M. Samuelides, L. Segoufin. Complementing deterministic tree-walking automata, Information Processing Letters 99, 33-39, 2006. doi:10.1016/j.ipl.2005.09.017
46. L. Muzamel. Pebble alternating tree-walking automata and their recognizing power, Manuscript, 2006.
47. F. Neven. Automata, logic, and XML, in: Computer Science Logic, 16th International Workshop, CSL 2002 (J.C. Bradfield, ed.), Lecture Notes in Computer Science 2471, 2-26, 2002.
48. F. Neven, T. Schwentick. On the power of tree-walking automata, Information and Computation 183, 86-103, 2003. doi:10.1016/S0890-5401(03)00013-0
49. F. Neven, T. Schwentick, V. Vianu. Finite state machines for strings over infinite alphabets, ACM Transactions on Computational Logic 5, 403-435, 2004. doi:10.1145/1013560.1013562
50. A. Okhotin, K. Salomaa, M. Domaratzki. One-visit caterpillar tree automata, Fundamenta Informaticae 52, 2002, 361-375.
51. H. Petersen. The equivalence of pebbles and sensing heads for finite automata, in: Proceedings 11th Symposium Fundamentals of Computation Theory, FCT’97, Lecture Notes in Computer Science 1279, 400-410, 1997. doi:10.1007/BFb0036201
52. A. Potthoff. Logische Klassifizierung regulärer Baumsprachen, PhD thesis, Institut für Informatik und Praktische Mathematik, Bericht Nr. 9410, Universität Kiel, 1994.
53. M.O. Rabin, D. Scott. Finite automata and their decision problems, IBM Journal of Research and Development 3, 114-125, 1959. Also in: Sequential Machines: Selected Papers (E.F. Moore, ed.), Addison-Wesley, Reading, MA, 1964, pp. 63-91. http://www.research.ibm.com/journal/rd/032/ibmrd0302C.pdf
54. R.W. Ritchie, F.N. Springsteel. Language recognition by marking automata, Information and Control 20, 313-330, 1972. doi:10.1016/S0019-9958(72)90205-7
55. H.A. Rollik. Automaten in planaren Graphen, Acta Informatica 13, 287-298, 1980. doi:10.1007/BF00288647
56. A. Rosenfeld. Picture Languages, Academic Press, New York, 1979.
57. T. Schwentick. Automata for XML-a survey, Journal of Computer and System Sciences 73, 289-315, 2007. doi:10.1016/j.jcss.2006.10.003
58. J.C. Shepherdson. The reduction of two-way automata to one-way automata, IBM Journal of Research and Development 3, 198-200, 1959. Also in: Sequential Machines: Selected Papers (E.F. Moore, ed.), Addison-Wesley, Reading, MA, 1964, pp. 92-97. http://www.research.ibm.com/journal/rd/032/ibmrd0302P.pdf
59. M. Sipser. Halting space-bounded computations, Theoretical Computer Science 10, 335-338, 1980. doi:10.1016/0304-3975(80)90053-5
60. G. Slutzki. Alternating tree automata, Theoretical Computer Science 41, 305-318, 1985. doi:10.1016/0304-3975(85)90077-5
61. R. Szelepcsényi. The method of forced enumeration for nondeterministic automata, Acta Informatica 26, 279-284, 1988. doi:10.1007/BF00299636
62. J.W. Thatcher, J.B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory 2, 57-81, 1968. doi:10.1007/BF01691346
63. W. Thomas. Languages, automata, and logic, in: Handbook of Formal Languages, Volume 3: Beyond Words (G. Rozenberg, A. Salomaa, eds.), Chapter 7, Springer-Verlag, 1997.
64. B.A. Trakhtenbrot. Finite automata and the logic of one-place predicates, Siberian Mathematical Journal 3, 103-131, 1962. (in Russian). English translation: American Mathematical Society Translations, Series 2 59, 23-55, 1966.
65. V. Vianu. A Web Odyssey: from Codd to XML, in: Proceedings of the 20th ACM Symposium on Principles of Database Systems, PODS 2001, ACM Press, 1-15, 2001. doi:10.1145/375551.375554
66. H. Vogler (ed.). International Workshop on Grammars, Automata, and Logic on Graphs and Trees, Technical Report TUD-FI99-01, Dresden University of Technology, March 1999.