Tree-walking automata cannot be determinized

Mikołaj Bojańczyk,Thomas Colcombet,M Bojanczyk

Theor. Comput. Sci.（2006）

引用 37|浏览5

暂无评分

摘要

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.

查看译文

关键词

tree-walking automata,deterministic tree-walking automata,tree-walking automaton,natural sequential model,finite tree,deterministic tree-walking automaton,deterministic tree-walking automata.,nondeterministic tree-walking automaton,automata walk

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要