Results 1 to 10 of about 23,480 (227)
Weighted Tree Automata with Constraints [PDF]
Theory of Computing Systems, 2023 The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM problem is decidable. JACM 60(4), 2013].
Andreas Maletti
exaly +5 more sources
Pushing for weighted tree automata [PDF]
Logical Methods in Computer Science, 2018 A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it is most useful ...
Thomas Hanneforth +2 more
doaj +6 more sources
Crisp-determinization of weighted tree automata over strong bimonoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics and their run semantics. There are wta for which these semantics are different; however, for bottom-up deterministic wta and for wta over semirings, the ...
Zoltán Fülöp +2 more
doaj +8 more sources
Hyper-Minimization for Deterministic Weighted Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided.
Andreas Maletti, Daniel Quernheim
doaj +6 more sources
Weighted tree automata and weighted logics
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Droste, H. Vogler
exaly +3 more sources
A Kleene theorem for weighted tree automata over tree valuation monoids
Information and Computation, 2019 We investigate weighted tree automata over Cauchy tree valuation monoids, a new type of weight structure which includes all commutative semirings and, in addition, average and discounted computations of weights for trees.
Zoltan Fülöp
exaly +4 more sources
From generic partition refinement to weighted tree automata minimization [PDF]
Formal Aspects of Computing, 2020 Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in the transition type of the given system and matches the run time of the best
Thorsten Wißmann +3 more
semanticscholar +5 more sources
Weighted Tree Automata - May it be a little more? [PDF]
arXiv.org, 2022 This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of Universal ...
Zoltán Fülöp, H. Vogler
semanticscholar +3 more sources
Weighted Languages Recognizable by Weighted Tree Automata
Acta Cybernetica, 2018 Yields of recognizable weighted tree languages, yields of local weighted tree languages, and weighted context-free languages are related. It is shown that the following five classes of weighted languages are the same: (i) the class of weighted languages ...
Zoltán Fülöp, Zsolt Gazdag
semanticscholar +3 more sources
Generic Partition Refinement and Weighted Tree Automata [PDF]
World Congress on Formal Methods, 2018 Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in the transition type of the given system and matches the run time of the best known algorithms for many concrete types of systems, e.g.
Hans-Peter Deifel +3 more
semanticscholar +3 more sources