Results 41 to 50 of about 31,589 (286)
Approximate comparison of distance automata [PDF]
, 2012 Distance automata are automata weighted over the semiring (N∪ {∞}, min,+) (the tropical semiring). Such automata compute functions from words to N ∪{∞} such as the number of occurrences of a given letter.
Colcombet, T., Daviaud, L.
core +4 more sources
Probabilistic Weighted Automata [PDF]
, 2009 Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal value of all runs over w, and the value of a run as the maximum, limsup, liminf, limit average, or discounted sum of ...
Chatterjee, Krishnendu +2 more
openaire +2 more sources
Approximate Comparison of Functions Computed by Distance Automata [PDF]
, 2015 Distance automata are automata weighted over the semiring (N∪{∞},min,+) (the tropical semiring). Such automata compute functions from words to N∪{∞}. It is known from Krob that the problems of deciding ‘ f≤g’ or ‘ f=g’ for f and g computed by distance ...
Colcombet, T., Daviaud, L.
core +1 more source
Alternating Weighted Automata [PDF]
, 2009 Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r.
Chatterjee, Krishnendu +2 more
openaire +1 more source
PAWS: A Tool for the Analysis of Weighted Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 PAWS is a tool to analyse the behaviour of weighted automata and conditional transition systems. At its core PAWS is based on a generic implementation of algorithms for checking language equivalence in weighted automata and bisimulation in conditional ...
Barbara König +2 more
doaj +1 more source
On the Disambiguation of Weighted Automata [PDF]
, 2014 We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a detailed description of the algorithm and the proof of its correctness.
C Allauzen +9 more
core +1 more source
Weighted Regular Tree Grammars with Storage [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids.
Zoltán Fülöp +2 more
doaj +1 more source
A Generalised Twinning Property for Minimisation of Cost Register Automata [PDF]
, 2015 Weighted automata (WA) extend finite-state automata by associating with transitions weights from a semiring S, defining functions from words to S.
Alur R. +3 more
core +4 more sources
Pumping Lemmas for Weighted Automata [PDF]
, 2018 We present three pumping lemmas for three classes of functions definable by fragments of weighted automata over the min-plus semiring and the semiring of natural numbers.
Mazowiecki, Filip, Riveros, Cristian
core +1 more source
Model Checking One-clock Priced Timed Automata [PDF]
Logical Methods in Computer Science, 2008 We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer +2 more
doaj +1 more source