Complementing deterministic tree-walking automata

Authors:
Anca Muscholl;Mathias Samuelides;Luc Segoufin
Affiliations:
LIAFA, Université Paris, France;LIAFA and INRIA, France;INRIA & Universitéé Paris, France
Venue:
Information Processing Letters
Year:
2006

Citing 4
Cited 9

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
Tree-Walking Pebble Automata

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
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

Language and Automata Theory and Applications
Pebble alternating tree-walking automata and their recognizing power

Acta Cybernetica
Pebble Macro Tree Transducers with Strong Pebble Handling

Fundamenta Informaticae
Circularity, composition, and decomposition results for pebble macro tree transducers

Journal of Automata, Languages and Combinatorics
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
On multi-head automata with restricted nondeterminism

Information Processing Letters
Pebble Macro Tree Transducers with Strong Pebble Handling

Fundamenta Informaticae
Complexity of pebble tree-walking automata

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider various kinds of deterministic tree-walking automata, with and without pebbles, over ranked and unranked trees. For each such kind of automata we show that there is an equivalent one which never loops. The main consequence of this result is the closure under complementation of the various types of automata we consider with a focus on the number of pebbles used in order to complement the automata.