Results 41 to 50 of about 1,475,237 (325)
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
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
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
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 +1 more source
Featured Weighted Automata [PDF]
2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE), 2017 A featured transition system is a transition system in which the transitions are annotated with feature expressions: Boolean expressions on a finite number of given features. Depending on its feature expression, each individual transition can be enabled when some features are present, and disabled for other sets of features.
Fahrenberg, Uli, Legay, Axel
openaire +4 more sources
Weighted omega-Restricted One Counter Automata [PDF]
Logical Methods in Computer Science, 2018 Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a ...
Manfred Droste, Werner Kuich
doaj +1 more source
Weight Annotation in Information Extraction [PDF]
Logical Methods in Computer Science, 2022 The framework of document spanners abstracts the task of information extraction from text as a function that maps every document (a string) into a relation over the document's spans (intervals identified by their start and end indices). For instance, the
Johannes Doleschal +3 more
doaj +1 more source
Decision-Guided Weighted Automata Extraction from Recurrent Neural Networks
AAAI Conference on Artificial Intelligence, 2021 Recurrent Neural Networks (RNNs) have demonstrated their effectiveness in learning and processing sequential data (e.g., speech and natural language). However, due to the black-box nature of neural networks, understanding the decision logic of RNNs is ...
Xiyue Zhang +5 more
semanticscholar +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