Complexity of pebble tree-walking automata

Authors:
Mathias Samuelides;Luc Segoufin
Affiliations:
LIAFA, Paris 7;INRIA, Paris
Venue:
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Year:
2007

Citing 12
Cited 5

Decidable optimization problems for database logic programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A note on the reduction of two-way automata to one-way atuomata

Information Processing Letters
Complexity results for two-way and multi-pebble automata and their logics

ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Trips on trees

Acta Cybernetica
Tree-Walking Pebble Automata

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Extensions of Attribute Grammars for Structured Document Queries

DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Typechecking for XML transformers

Journal of Computer and System Sciences - Special issue on PODS 2000
Tree-walking automata do not recognize all regular languages

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tree-walking automata cannot be determinized

Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Complementing deterministic tree-walking automata

Information Processing Letters
Nested pebbles and transitive closure

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Expressive power of pebble automata

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Tree-Walking Automata

Language and Automata Theory and Applications
Pebble weighted automata and transitive closure logics

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The complexity of text-preserving XML transformations

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Parameter reduction and automata evaluation for grammar-compressed trees

Journal of Computer and System Sciences
Adding pebbles to weighted automata

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.