Weighted Expressions and DFS Tree Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

Weighted Expressions and DFS Tree Automata

Abstract

We introduce weighted expressions, a calculus to express quantitative properties over unranked trees. They involve products and sums from a semiring as well as classical boolean formulas. We show that weighted expressions are expressively equivalent to a new class of weighted tree-walking automata. This new automata model is equipped with pebbles, and follows a depth-first-search policy in the tree.

Domains

Other [cs.OH]
No file

Dates and versions

hal-00779951 , version 1 (22-01-2013)

Identifiers

  • HAL Id : hal-00779951 , version 1

Cite

Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Weighted Expressions and DFS Tree Automata. [Research Report] LSV-11-08, 2011. ⟨hal-00779951⟩
162 View
0 Download

Share

Gmail Facebook X LinkedIn More