Results 31 to 40 of about 842,589 (329)
Quantitative Automata under Probabilistic Semantics [PDF]
Logical Methods in Computer Science, 2019 Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Krishnendu Chatterjee +2 more
doaj +1 more source
Mathematical Structures in Computer Science, 2022 AbstractThis paper introduces a class of automata and associated languages, suitable to model a computational paradigm of fuzzy systems, in which both vagueness and simultaneity are taken as first-class citizens. This requires a weighted semantics for transitions and a precise notion of a synchronous product to enforce the simultaneous occurrence of ...
Leandro Gomes 0001 +2 more
openaire +4 more sources
On the Complexity of Equivalence and Minimisation for Q-weighted Automata [PDF]
Logical Methods in Computer Science, 2013 This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers.
Stefan Kiefer +4 more
doaj +1 more source
Weighted Automata and Expressions over Pre-Rational Monoids [PDF]
Annual Conference for Computer Science Logic, 2021 The Kleene theorem establishes a fundamental link between automata and expressions over the free monoid. Numerous generalisations of this result exist in the literature. Lifting this result to a weighted setting has been widely studied.
Nicolas Baudru +5 more
semanticscholar +1 more source
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 +1 more source
Weighted DAG Automata for Semantic Graphs [PDF]
Computational Linguistics, 2018 Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels the ...
David Chiang +4 more
doaj +2 more sources
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata [PDF]
, 2021 We address the approximate minimization problem for weighted finite automata (WFAs) with weights in ℝ, over a one-letter alphabet: to compute the best possible approximation of a WFA given a bound on the number of states. This work is grounded in Adamyan-
Rabusseau, Guillaume +4 more
core +1 more source
Quantitative Languages Defined by Functional Automata [PDF]
Logical Methods in Computer Science, 2015 A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges
Emmanuel Filiot +2 more
doaj +1 more source
A Translation of Weighted LTL Formulas to Weighted Buchi Automata over omega-valuation Monoids
Scientific Annals of Computer Science, 2021 In this paper we introduce a weighted LTL over product omega-valuation monoids that satisfy specific properties. We also introduce weighted generalized Buchi automata with epsilon-transitions, as well as weighted Buchi automata with epsilon-transitions ...
Eleni Mandrali
doaj +1 more source
Automata Minimization: a Functorial Approach [PDF]
Logical Methods in Computer Science, 2020 In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that specify the type
Thomas Colcombet, Daniela Petrişan
doaj +1 more source