Results 61 to 70 of about 1,475,237 (325)
Morphisms and minimisation of weighted automata
Fundamenta Informaticae, 2022 This paper studies the algorithms for the minimisation of weighted automata. It starts with the definition of morphisms-which generalises and unifies the notion of bisimulation to the whole class of weighted automata-and the unicity of a minimal quotient for every automaton, obtained by partition refinement.
Lombardy, Sylvain, Sakarovitch, Jacques
openaire +5 more sources
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata [PDF]
TheoretiCSWe develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata for infinite ...
Mikołaj Bojańczyk +3 more
doaj +1 more source
Weighted Automata and Monadic Second Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Let S be a commutative semiring. M. Droste and P. Gastin have introduced in 2005 weighted monadic second order logic WMSOL with weights in S. They use a syntactic fragment RMSOL of WMSOL to characterize word functions (power series) recognizable by ...
Nadia Labai, Johann A. Makowsky
doaj +1 more source
Quantum Finite Automata and Weighted Automata
J. Autom. Lang. Comb., 2007 10 pages, Preliminary version appears in the Proceedings of ACiD-2005, Texts in Algorithmics series of KCL publications, pp.
M. V. Panduranga Rao, V. Vinay
openaire +4 more sources
Robustness in Timed Automata [PDF]
, 2013 In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors.
Markey, Nicolas +7 more
core +1 more source
The Triple-Pair Construction for Weighted ω-Pushdown Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule pair ((S ...
Manfred Droste +2 more
doaj +1 more source
Applications in Enumerative Combinatorics of In finite Weighted Automata and Graphs [PDF]
Scientific Annals of Computer Science, 2014 In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted
R. De Castro, A. Ramírez, J.L. Ramírez
doaj +1 more source
Complementation and Inclusion of Weighted Automata on Infinite Trees [PDF]
, 2022 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 +2 more sources
Connecting weighted automata, tensor networks and recurrent neural networks through spectral learning [PDF]
Machine-mediated learning, 2020 In this paper, we present connections between three models used in different research fields: weighted finite automata (WFA) from formal languages and linguistics, recurrent neural networks used in machine learning, and tensor networks which encompasses ...
Tianyu Li +2 more
semanticscholar +1 more source
On the Disambiguation of Weighted Automata [PDF]
, 2015 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.
Mehryar Mohri, Michael D. Riley
openaire +2 more sources