Results 11 to 20 of about 1,963,594 (263)
Approximating Probabilistic Models as Weighted Finite Automata [PDF]
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 +5 more sources
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings [PDF]
Logical Methods in Computer Science, 2023 This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating automata and prove ...
Gustav Grabolle
doaj +3 more sources
Finite-Valued Weighted Automata. [PDF]
, 2014 Any weighted automaton (WA) defines a relation from finite words to values: given an input word, its set of values is obtained as the set of values computed by each accepting run on that word. A WA is k-valued if the relation it defines has degree at most k, i.e., every set of values associated with an input word has cardinality at most k.
E. Filiot +2 more
openaire +6 more sources
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata [PDF]
TheoretiCS, 2021 We 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 +3 more sources
Human Activity Recognition through Weighted Finite Automata
Proceedings, 2018 This work addresses the problem of human activity identification in an ubiquitous environment, where data is collected from a wide variety of sources.
Sergio Salomón, Cristina Tîrnăucă
doaj +3 more sources
Functional Closure Properties of Finite ℕ-Weighted Automata. [PDF]
CoRRWe determine all functional closure properties of finite ℕ-weighted automata, even all multivariate ones, and in particular all multivariate polynomials. We also determine all univariate closure properties in the promise setting, and all multivariate closure properties under certain assumptions on the promise, in particular we determine all ...
Dörfler, Julian, Ikenmeyer, Christian
openaire +5 more sources
MathematicsThe zeroing neural network (ZNN) is an important kind of continuous-time recurrent neural network (RNN). Meanwhile, the existence of forward and backward simulations and bisimulations for weighted finite automata (WFA) over the field of real numbers has ...
Predrag S. Stanimirović +4 more
doaj +3 more sources
Linear Encoding Scheme for Weighted Finite Automata
, 2005 In this paper, we show that the linear encoding scheme efficiently implements weighted finite automata (WFA). WFA with t transitions can be hardwired with $\mathcal{O}$(t) cells. They solve pattern matching problems in a pipelined way, parsing one character every clock cycle.
Mathieu Giraud, Dominique Lavenier
openaire +3 more sources
Logical Methods in Computer Science, 2022 Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second.
Dmitry Chistikov +3 more
doaj +1 more source
On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models [PDF]
Computational Linguistics, 2017 Probabilistic finite-state automata are a formalism that is widely used in many problems of automatic speech recognition and natural language processing.
Joan Andreu Sánchez +3 more
doaj +2 more sources