Results 21 to 30 of about 31,589 (286)
Weighted DAG Automata for Semantic Graphs [PDF]
Computational Linguistics, 2017 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
Pebble Weighted Automata and Weighted Logics [PDF]
ACM Transactions on Computational Logic, 2014 We introduce new classes of weighted automata on words. Equipped with pebbles, they go beyond the class of recognizable formal power series: they capture weighted first-order logic enriched with a quantitative version of transitive closure. In contrast to previous work, this calculus allows for unrestricted use of existential and universal ...
Bollig, Benedikt +3 more
openaire +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
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 +2 more
openaire +4 more sources
Bideterministic Weighted Automata
Information and Computation, 2022 A finite automaton is called bideterministic if it is both deterministic and codeterministic -- that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated. All trim bideterministic weighted automata over integral domains and over positive semirings are proved to be minimal ...
openaire +3 more sources
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
Efficient Completion of Weighted Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows updates of the graph: adding nodes and edges, and changing weights of ...
Johannes Waldmann
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 +3 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 +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