Abstract
First-order logic with k-ary deterministic transitive closure has the same power as two-way k-head deterministic automata that use a finite set of nested pebbles. This result is valid for strings, ranked trees, and in general for families of graphs having a fixed automaton that can be used to traverse the nodes of each of the graphs in the family. Other examples of such families are grids, toruses, and rectangular mazes.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: Translations on a context free grammar. Inform. Control. 19, 439–475 (1971)
Bargury, Y., Makowsky, J.A.: The expressive power of transitive closure and 2-way multihead automata. In: Kleine Büning, H., Jäger, G., Börger, E., Richter, M.M. (eds.) CSL 1991. LNCS, vol. 626, pp. 1–14. Springer, Heidelberg (1992)
Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: Proceedings 8th IEEE SWAT, pp. 155–160 (1967)
Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: Proceedings 19th FOCS, pp. 132–142 (1978)
Bojańczyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 246–256. Springer, Heidelberg (2004)
Bojańczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: Gabow, H.N., Fagin, R. (eds.) Proceedings 37th STOC (2005)
Brüggemann-Klein, A., Wood, D.: Caterpillars: A context specification technique. Markup Languages 2, 81–106 (2000)
Budach, L.: Automata and labyrinths. Math. Nachr. 86, 195–282 (1978)
Cook, S.A., Rackoff, C.W.: Space lower bounds for maze threadability on restricted machines. SIAM J. Comput. 9, 636–652 (1980)
Doner, J.: Tree acceptors and some of their applications. J. Comp. Syst. Sci. 4, 406–451 (1970)
Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Perspectives in Mathematical Logic. Springer, Berlin (1999)
Engelfriet, J.: Context-free grammars with storage, Leiden University, Technical Report 86–11 (1986)
Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Karhumäki, J., et al. (eds.) Jewels are forever, pp. 72–83. Springer, Heidelberg (1999)
Engelfriet, J., Hoogeboom, H.J.: Automata with nested pebbles capture first-order logic with transitive closure. LIACS Tech. Rep. 2005-02, Leiden University (2005)
Engelfriet, J., Hoogeboom, H.J., van Best, J.-P.: Trips on trees. Acta Cyb. 14, 51–64 (1999)
Engelfriet, J., Maneth, S.: A comparison of pebble tree transducers with macro tree transducers. Acta Inf. 39, 613–698 (2003)
Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J. Comp. Syst. Sci. 20, 150–202 (1980)
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, Springer, Heidelberg (1997)
Globerman, N., Harel, D.: Complexity results for two-way and multi-pebble automata and their logics. TCS 169, 161–184 (1996)
Immerman, N.: Languages that capture complexity classes. SIAM J. Comput. 16, 760–778 (1987)
Immerman, N.: Descriptive Complexity. Springer, New York (1999)
Kamimura, T., Slutzki, G.: Parallel and two-way automata on directed ordered acyclic graphs. Inform. Control. 49, 10–51 (1981)
Klarlund, N., Schwentick, T., Suciu, D.: XML: Model, Schemas, Types, Logics, and Queries. In: Chomicki, J., et al. (eds.) Logics for Emerging Applications of Databases, pp. 1–41. Springer, Heidelberg (2004)
Matz, O., Schweikardt, N., Thomas, W.: The monadic quantifier alternation hierarchy over grids and graphs. Inform. Comput. 179, 356–383 (2002)
Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comp. Syst. Sci. 66, 66–97 (2003)
Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO – ITA 14, 67–82 (1980)
Muscholl, A., Samuelides, M., Segoufin, L.: Complementing deterministic tree-walking automata, Manuscript. In: IPL (To appear, 2005)
Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)
Neven, F., Schwentick, T.: On the power of tree-walking automata. Inform. Comput. 183, 86–103 (2003)
Okhotin, A., Salomaa, K., Domaratzki, M.: One-visit caterpillar tree automata. Fund. Inf. 52, 361–375 (2002)
Potthoff, A.: Logische Klassifizierung regulärer Baumsprachen, PhD thesis, Institut für Informatik und Praktische Mathematik, Universität Kiel (1994)
Sipser, M.: Halting space-bounded computations. TCS 10, 335–338 (1980)
Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. MST 2, 57–81 (1968)
Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J., Hoogeboom, H.J. (2006). Nested Pebbles and Transitive Closure. In: Durand, B., Thomas, W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11672142_39
Download citation
DOI: https://doi.org/10.1007/11672142_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32301-3
Online ISBN: 978-3-540-32288-7
eBook Packages: Computer ScienceComputer Science (R0)