Results 31 to 40 of about 31,589 (286)
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
Approximation of Weighted Automata with Storage [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We use a non-deterministic variant of storage types to develop a framework for the approximation of automata with storage. This framework is used to provide automata-theoretic views on the approximation of multiple context-free languages and on coarse ...
Tobias Denkinger
doaj +1 more source
Approximating Probabilistic Models as Weighted Finite Automata
Computational Linguistics, 2021 Weighted finite automata (WFAs) are often used to represent probabilistic models, such as n-gram language models, because among other things, they are efficient for recognition tasks in time and space. The probabilistic source to be represented as a WFA,
Ananda Theertha Suresh +3 more
doaj +1 more source
Expressiveness and Closure Properties for Quantitative Languages [PDF]
Logical Methods in Computer Science, 2010 Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$.
Krishnendu Chatterjee +2 more
doaj +1 more source
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
Minimization via duality [PDF]
, 2012 We show how to use duality theory to construct minimized versions of a wide class of automata. We work out three cases in detail: (a variant of) ordinary automata, weighted automata and probabilistic automata.
A. Beimel +9 more
core +2 more sources
Kleene Algebras and Semimodules for Energy Problems [PDF]
, 2013 With the purpose of unifying a number of approaches to energy problems found in the literature, we introduce generalized energy automata. These are finite automata whose edges are labeled with energy functions that define how energy levels evolve during ...
A. Degorre +22 more
core +5 more sources
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
A Robust Class of Linear Recurrence Sequences [PDF]
, 2019 We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product.
+3 more
core +2 more sources
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