We compare the expressive power of these two solutions and show that a weighted tree language recognizable (resp. definable) over a tree valuation monoid is ...

We compare the expressive power of these two solutions and show that a weighted tree language recognizable (resp. definable) over a tree valuation monoid is ...

Jul 24, 2015 · The authors compare two weight structures designed to overcome some limitations of weighted tree automata (wta) over semirings, ...

No information is available for this page. · Learn why

Quantitative aspects of systems can be modeled by weighted automata. Here, we deal with such automata running on finite trees.

ter 3, we show the deep connections between logic and automata. In particular, we prove in full details the correspondence between finite tree automata and.

There has been a resurgence of interest in automata on infinite objects [1] due to their intimate relation with temporal and modal logics of programs. They ...

Valuation structures finally also replace the sum by a more general evaluation operator, for instance ratios of several weights computed simultane- ously. As an ...

A tree series over a Cauchy tree valuation monoid is recognizable by a weighted tree automaton if and only if it is rational.

In this paper, we provide a mathematical framework to address these problems. We introduce three and six-valued characterizations of regular languages under ...