Results 191 to 200 of about 23,480 (227)
Some of the next articles are maybe not open access.
Approximate minimization of weighted tree automata
Information and Computation, 2020This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a weighted tree language f, can we construct a smaller automaton A ˆ with n ˆ n states recognizing a language f ˆ that ...
Borja Balle, Guillaume Rabusseau
semanticscholar +3 more sources
Weighted Logics for Unranked Tree Automata
Theory of Computing Systems, 2009Generalizing similar work on weighted string and tree languages, on the one hand, and work on unranked tree languages, on the other hand, the authors introduce weighted tree automata and a weighted monadic second-order (MSO) logic for unranked trees (i.e., trees in which a node labeled by a given symbol may have any number of children).
Droste, Manfred, Vogler, Heiko
exaly +2 more sources
Weighted Tree Automata and Tree Transducers
, 2009We survey some important results for weighted tree automata and weighted tree transducers over finite ranked trees and semirings as weight structure. In particular, we address closure properties of the class of recognizable tree series, results on the support of such tree series, the determinization of weighted tree automata, pumping lemmata and ...
Zoltán Fülöp, H. Vogler
semanticscholar +2 more sources
Determinization of Finite State Weighted Tree Automata
J. Autom. Lang. Comb., 2003Journal of Automata, Languages and Combinatorics, Volume 8, Number 3, 2003, 417 ...
B. Borchardt, H. Vogler
semanticscholar +3 more sources
Kleene’s Theorem for Weighted Tree-Automata
Lecture Notes in Computer Science, 2003We sketch the proof of a Kleene-type theorem for formal tree-series over commutative semirings. That is, for a suitable set of rational operations we show that the proper rational formal tree-series coincide with the recognizable ones. A complete proof is part of the PhD-thesis of the author, which is available at [9].
Christian Pech
exaly +2 more sources
Disambiguation of Weighted Tree Automata
Workshop on Descriptional Complexity of Formal Systems, 2021K. Stier, Markus Ulbricht
semanticscholar +2 more sources
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
Language and Automata Theory and Applications, 2015We generalise a search algorithm by Mohri and Riley from strings to trees. The original algorithm takes as input a weighted automaton \(M\) over the tropical semiring, together with an integer \(N\), and outputs \(N\) strings of minimal weight with respect to \(M\).
Johanna Björklund +2 more
semanticscholar +3 more sources
Determinization of Weighted Tree Automata Using Factorizations
J. Autom. Lang. Comb., 2010Journal of Automata, Languages and Combinatorics, Volume 15, Numbers 3-4, 2010, 229 ...
Matthias Büchse +2 more
semanticscholar +2 more sources
Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
Algebraic Foundations in Computer Science, 2011Quantitative aspects of systems can be modeled by weighted automata. Here, we deal with such automata running on finite trees. Usually, transitions are weighted with elements of a semiring and the behavior of the automaton is obtained by multiplying the weights along a run.
M. Droste +3 more
semanticscholar +2 more sources
A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids
Lecture Notes in Computer Science, 2016Manfred Droste +2 more
exaly +2 more sources