Complexity Of Pebble Tree-Walking Automata

FCT'07: Proceedings of the 16th international conference on Fundamentals of Computation Theory（2007）

引用 9|浏览4

暂无评分

摘要

We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k, we give the precise complexities of the problems of emptiness and inclusion of tree-walking automata using k pebbles.

查看译文

关键词

k pebble,tree-walking automaton,precise complexity,pebble tree-walking automaton

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要