Results 211 to 220 of about 23,480 (227)

The structure of polynomial growth for tree automata/transducers and MSO set queries

arXiv.org
Given an $\mathbb{N}$-weighted tree automaton, we give a decision procedure for exponential vs polynomial growth (with respect to the input size) in quadratic time, and an algorithm that computes the exact polynomial degree of growth in cubic time.
Paul Gallot, N. Lhote, Le Thanh Dung Nguyen   +2 more
semanticscholar   +1 more source

Weighted Muller Tree Automata and Weighted Logics

2007
Journal of Automata, Languages and Combinatorics, Volume 12, Number 4, 2007, 455 ...
openaire   +1 more source

Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics

2015
We introduce a new behavior of weighted unranked tree automata. We prove a characterization of this behavior by two fragments of weighted MSO logic and thereby provide a solution of an open equivalence problem of Droste and Vogler. The characterization works for valuation monoids as weight structures; they include all semirings and, in addition, enable
Manfred Droste, Doreen Heusel, Heiko Vogler   +2 more
openaire   +1 more source

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

Workshop on Descriptional Complexity of Formal Systems, 2020
M. Droste, Zoltán Fülöp, Dávid Kószó, H. Vogler   +3 more
semanticscholar   +1 more source

Weighted Expressions and DFS Tree Automata

2011
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.
Bollig, Benedikt, Gastin, Paul, Monmege, Benjamin, Zeitoun, Marc   +3 more
openaire   +1 more source

Reasoning with Prototypes in the Description Logic ALC ALC Using Weighted Tree Automata

Language and Automata Theory and Applications, 2016
F. Baader, Andreas Ecke
semanticscholar   +1 more source

Disambiguation of Weighted Tree Automata

Lecture Notes in Computer Science, 2022
Kevin Stier
exaly  

Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL_0

Language and Automata Theory and Applications, 2017
F. Baader, O. Gil, Pavlos Marantidis
semanticscholar   +1 more source

From generic partition refinement to weighted tree automata minimization

Formal Aspects of Computing, 2021
Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius   +2 more
exaly  

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata

International Conference on Implementation and Application of Automata, 2018
Johanna Björklund, F. Drewes, Anna Jonsson   +2 more
semanticscholar   +1 more source