Results 201 to 210 of about 23,480 (227)

DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA

International Journal of Foundations of Computer Science, 2009
Weighted multioperator tree automata (for short: wmta) are finite-state bottom-up tree automata in which the transitions are weighted with an operation taken from some multioperator monoid. A wmta recognizes a tree series which is a mapping from the set of trees to some commutative monoid.
Stüber, Torsten, Vogler, Heiko, Fülöp, Zoltán   +2 more
openaire   +2 more sources

The generating power of weighted tree automata with initial algebra semantics

arXiv.org
We consider the images of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings). These images are subsets of the carrier set of the underlying strong bimonoid. We consider locally finite, weakly locally
Manfred Droste, Zoltán Fülöp, A. Tepavčević, H. Vogler   +3 more
semanticscholar   +1 more source

The Supports of Weighted Unranked Tree Automata

Fundamenta Informaticae, 2015
We investigate the supports of weighted unranked tree automata. Our main result states that the support of a weighted unranked tree automaton over a zero-sum free, commutative strong bimonoid is recognizable. For this, we use methods of Kirsten (DLT 2009), in particular, his construction of finite automata recognizing the supports of weighted automata ...
Droste, Manfred, Heusel, Doreen
openaire   +2 more sources

Relating Tree Series Transducers and Weighted Tree Automata

International Journal of Foundations of Computer Science, 2004
Bottom-up tree series transducers (tst) over the semiring [Formula: see text] are implemented with the help of bottom-up weighted tree automata (wta) over an extension of [Formula: see text]. Therefore bottom-up [Formula: see text]-weighted tree automata ([Formula: see text]-wta) with [Formula: see text] a distributive Ω-algebra are introduced.
openaire   +1 more source

Bisimulation Minimisation of Weighted Automata on Unranked Trees

Fundamenta Informaticae, 2009
Several models of automata are available that operate unranked trees. Two well-known examples are the stepwise unranked tree automaton (suta) and the parallel unranked tree automaton (puta). By adding a weight, taken from some semiring, to every transition we generalise these two qualitative automata models to quantitative models, thereby obtaining ...
Högberg, Johanna, Maletti, Andreas, Vogler, Heiko   +2 more
openaire   +1 more source

THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA

International Journal of Foundations of Computer Science, 2011
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in several cases (fields, commutative rings, NOETHERIAN semirings, semiring of natural numbers) that all equivalent ...
Ésik, Zoltán, Maletti, Andreas
openaire   +1 more source

Weighted tree automata with discounting:

2008
top-down bottom-up discounting . .
openaire   +1 more source

Effective optimization with weighted automata on decomposable trees

Optimization, 2014
In this paper, we consider quantitative optimization problems on decomposable discrete systems. We restrict ourselves to labeled trees as the description of the systems and we use weighted automata on them as our computational model. We introduce a new kind of labeled decomposable trees, sum-like weighted labeled trees, and propose a method, which ...
E.V. Ravve, Z. Volkovich, G.-W. Weber
openaire   +1 more source

A theorem on supports of weighted tree automata over strong bimonoids

New Mathematics and Natural Computation, 2022
M. Ghorani, H. Vogler
semanticscholar   +1 more source

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras

arXiv.org
Due to the works of S. Bozapalidis and A. Alexandrakis, there is a well-known characterization of recognizable weighted tree languages over fields in terms of finite-dimensionality of syntactic vector spaces. Here we prove a characterization of bottom-up
Zoltán Fülöp, H. Vogler
semanticscholar   +1 more source