Running Tree Automata on Trees and/or Dags

Abstract : We define tree/dag automata as extensions of (unranked) tree automata which can run indifferently on trees or dags, in a bottom-up style. The runs of such an automaton A on any tree or dag t are defined by assigning states not only to the nodes of t, but also to its edges. Runs are so defined that A accepts t if and only if it accepts the tree \hat{t} obtained by unfolding t, as a tree automaton running in the usual sense on \hat{t}.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Siva Anantharaman <>
Submitted on : Friday, August 25, 2006 - 2:11:06 PM
Last modification on : Thursday, January 17, 2019 - 3:06:06 PM
Long-term archiving on: Thursday, September 23, 2010 - 4:20:14 PM


  • HAL Id : hal-00080644, version 3



Barbara Fila, Siva Anantharaman. Running Tree Automata on Trees and/or Dags. 2006. ⟨hal-00080644v3⟩



Record views


Files downloads