论文信息 - Tree-walking automata cannot be determinized

Tree-walking automata cannot be determinized

Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is shown that deterministic tree-walking automata are weaker than nondeterministic tree-walking automata.

Thomas Colcombet | Mikolaj Bojanczyk

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

[2] M. Blum,et al. Automata on a 2-Dimensional Tape , 1967, SWAT.

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

[4] A. Gill. SWITCHING AND AUTOMATA THEORY. , 1970 .

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

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

[7] J. Howie. Fundamentals of semigroup theory , 1995 .

[8] Jaikumar Radhakrishnan,et al. FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science , 2004, Lecture Notes in Computer Science.

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

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

[11] Mikolaj Bojanczyk,et al. 1-Bounded TWA Cannot Be Determinized , 2003, FSTTCS.