1-Bounded TWA Cannot Be Determinized

Tree-walking automata are a natural sequential model for recognizing tree languages which is closely connected to XML. Two long standing conjectures say TWA cannot recognize all regular languages and that deterministic TWA are weaker than nondeterministic TWA. We consider a weaker model, 1-TWA, of tree walking automata that can make only one pass through a tree. We show that deterministic 1-TWA are weaker than 1-TWA. We also show a very simple language not recognized by 1-TWA.

[1]  Derick Wood,et al.  Caterpillars: A Context Specification Technique , 2000, Markup languages.

[2]  Dan Suciu,et al.  Typechecking for XML transformers , 2000, J. Comput. Syst. Sci..

[3]  Thomas Schwentick,et al.  On the Power of Tree-Walking Automata , 2000, ICALP.

[4]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[5]  Jan-Pascal van Best,et al.  Trips on Trees , 1999, Acta Cybern..

[6]  Giora Slutzki,et al.  Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs , 1981, Inf. Control..

[7]  Alfred V. Aho,et al.  Translations on a Context-Free Grammar , 1971, Inf. Control..

[8]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[9]  Frank Neven,et al.  Automata, Logic, and XML , 2002, CSL.

[10]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[11]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[12]  Joost Engelfriet,et al.  Tree-Walking Pebble Automata , 1999, Jewels are Forever.