Complexity of pebble tree-walking automata
Résumé
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 of inclusion of tree-walking automata using k pebbles.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...