Tree automata and attribute grammars
Information and Control
Theoretical Computer Science
Handbook of formal languages, vol. 3
Acta Cybernetica
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit automata can already, for instance, evaluate trees where the nodes represent some non-associative operations. We show that there exist regular tree languages that cannot be accepted by a one-visit automaton, thus proving a weakened form of a conjecture of Brüggemann-Klein and Wood [3]. We establish that the k-visit property is decidable.