Results 41 to 50 of about 1,963,594 (263)
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata [PDF]
We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring.
Paul, Erik
core +1 more source
Synchronizing weighted automata [PDF]
We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if there exists a ...
Szabolcs Iván
doaj +1 more source
Complementation and Inclusion of Weighted Automata on Infinite Trees [PDF]
Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting.
Borgwardt, Stefan, Peñaloza, Rafael
core +3 more sources
Weighted Finite Automata over Strong Bimonoids [PDF]
We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need to hold. We define two different behaviors and prove precise characterizations
Vogler, Heiko +2 more
core +2 more sources
Weighted finite automata over hemirings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manfred Droste, Werner Kuich
openaire +2 more sources
Feasability of Learning Weighted Automata on a Semiring [PDF]
Since the seminal work by Angluin and the introduction of the L*-algorithm, active learning of automata by membership and equivalence queries has been extensively studied to learn various extensions of automata.
Laure Daviaud, Marianne Johnson
doaj +1 more source
Bisimulation Metrics for Weighted Automata [PDF]
We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA.
Gourdeau, Pascale +2 more
core +1 more source
Nested Weighted Automata [PDF]
Recently there has been a significant effort to add quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties ...
Krishnendu Chatterjee +7 more
core +1 more source
The major challenge with fractal image/video coding technique is that, it requires more encoding time. Therefore, how to reduce the encoding time is the research component remains in the fractal coding.
Shailesh Kamble +2 more
doaj +1 more source
Integer Weighted Automata on Infinite Words [PDF]
In this paper we combine two classical generalisations of finite automata (weighted automata and automata on infinite words) into a model of integer weighted automata on infinite words and study the universality and the emptiness problems under zero ...
Harju, T +7 more
core +2 more sources

