Running Tree Automata on Trees and/or Dags - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2006

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}.
Fichier principal
Vignette du fichier
FilaSiva-TDA06.pdf (126.56 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-00080644 , version 1 (19-06-2006)
hal-00080644 , version 2 (04-08-2006)
hal-00080644 , version 3 (25-08-2006)

Identifiers

  • HAL Id : hal-00080644 , version 3

Cite

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

Share

Gmail Facebook X LinkedIn More