Results 241 to 250 of about 31,589 (286)
Some of the next articles are maybe not open access.
Automata with Auxiliary Weights
International Journal of Foundations of Computer Science, 2016We introduce a new generalization of weighted automata – automata with auxiliary weights. They allow to compute several quantities not directly computable over semirings by generalizing both semiring addition and semiring multiplication. Moreover, our automata retain key properties of ordinary weighted automata.
Kostolányi, Peter, Rovan, Branislav
openaire +2 more sources
The Validity of Weighted Automata
International Journal of Algebra and Computation, 2013This paper addresses the problem of the validity of weighted automata in which the presence of ε-circuits results in infinite summations. Earlier works either rule out such automata or characterize the semirings in which these infinite sums are all well-defined.By means of a topological approach, we take here a definition of validity that is strong ...
Lombardy, Sylvain, Sakarovitch, Jacques
openaire +1 more source
Soft Computing, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Otto, Friedrich, Wang, Qichao
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Otto, Friedrich, Wang, Qichao
openaire +1 more source
Weighted Picture Automata and Weighted Logics
Theory of Computing Systems, 2006The author introduces a weighted MSO logic for defining series of pictures; here a picture is a finite rectangular array of symbols from a given (finite) alphabet. The main results of the paper show that the picture series over any commutative semiring definable by this logic are the same as the series recognized by weighted two-dimensional on-line ...
openaire +1 more source
Weighted automata and weighted logics on infinite words
Russian Mathematics, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Droste, M., Rahonis, G.
openaire +2 more sources
2015
Weighted finite automata (WFA) are finite automata whose transitions and states are augmented with some weights, elements of a semiring. A WFA induces a function over strings. The value it assigns to an input string is the semiring sum of the weights of all paths labeled with that string, where the weight of a path is obtained by taking the semiring ...
Borja Balle, Mehryar Mohri
openaire +1 more source
Weighted finite automata (WFA) are finite automata whose transitions and states are augmented with some weights, elements of a semiring. A WFA induces a function over strings. The value it assigns to an input string is the semiring sum of the weights of all paths labeled with that string, where the weight of a path is obtained by taking the semiring ...
Borja Balle, Mehryar Mohri
openaire +1 more source
ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
International Journal of Algebra and Computation, 2007We investigate Büchi automata with weights for the transitions. Assuming that the weights are taken in a suitable ordered semiring, we show how to define the behaviors of these automata on infinite words. Our main result shows that the formal power series arising in this way are precisely the ones which can be constructed using ω-rational operations ...
Droste, Manfred, Püschmann, Ulrike
openaire +2 more sources
Weighted Automata Sequence Kernel
Proceedings of the 9th International Conference on Machine Learning and Computing, 2017Sequence kernels are widely used for learning from sequential data. The literature includes a variety of sequence kernels. In this paper, we present a general framework to deal with sequence kernels, termed weighted automata sequence kernel. In fact, the mapping of a string s to a high dimensional feature space can be modeled by a formal power series ...
Slimane Bellaouar +3 more
openaire +1 more source
Weighted Watson-Crick automata
AIP Conference Proceedings, 2014There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works ...
Mohd Izzuddin Mohd Tamrin +2 more
openaire +1 more source
Multiple weighted cellular automata
Proceedings of IEEE VLSI Test Symposium, 2002Presents a complete design method for inhomogeneous cellular automata capable of generating BIST patterns with multiple weight sets at a test per clock rate. The method achieves 100% stuck-at fault coverage of detectable faults for almost all combinational benchmark circuits having random pattern resistant faults.
D.J. Neebel, C.R. Kime
openaire +1 more source