Results 21 to 30 of about 1,963,594 (263)
Crisp-determinization of weighted tree automata over strong bimonoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics and their run semantics. There are wta for which these semantics are different; however, for bottom-up deterministic wta and for wta over semirings, the ...
Zoltán Fülöp +2 more
doaj +1 more source
Algebraic Methods for Finite Linear Cellular Automata [PDF]
, 1996 PhDCellular automata are a simple class of extended dynamical systems which have been much studied in recent years. Linear cellular automata are the class of cellular automata most amenable to algebraic analytic treatments, algebraic techniques are ...
Dow, R. A.
core +4 more sources
Weighted finite automata with output [PDF]
Soft Computing, 2017 In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.
Jelena Ignjatovic +2 more
openaire +3 more sources
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence [PDF]
Logical Methods in Computer Science, 2022 We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by ...
Thorsten Wißmann +2 more
doaj +1 more source
Weighted Automata over Vector Spaces [PDF]
, 2023 In this paper we deal with three models of weighted automata that take weights in the field of real numbers. The first of these models are classical weighted finite automata, the second one are crisp-deterministic weighted automata, and the third one are
Ćirić, Miroslav +2 more
core +1 more source
On the Complexity of Equivalence and Minimisation for Q-weighted Automata [PDF]
Logical Methods in Computer Science, 2013 This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers.
Stefan Kiefer +4 more
doaj +1 more source
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata [PDF]
, 2021 We address the approximate minimization problem for weighted finite automata (WFAs) with weights in ℝ, over a one-letter alphabet: to compute the best possible approximation of a WFA given a bound on the number of states. This work is grounded in Adamyan-
Rabusseau, Guillaume +4 more
core +1 more source
Hyper-Minimization for Deterministic Weighted Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided.
Andreas Maletti, Daniel Quernheim
doaj +1 more source
Arithmetic coding of weighted finite automata [PDF]
RAIRO - Theoretical Informatics and Applications, 1994 Summary: Karel Culik and the first author have demonstrated how Weighted Finite Automata (WFA) provide a strong lool for image compression. In the present article we introduce an improved method for the last step of the compression algorithm: for compressing the WFA that approximate the given image.
Jarkko Kari 0001, Pasi Fränti
openaire +2 more sources
Quantitative Languages Defined by Functional Automata [PDF]
Logical Methods in Computer Science, 2015 A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges
Emmanuel Filiot +2 more
doaj +1 more source