Results 11 to 20 of about 31,589 (286)
Nested Weighted Limit-Average Automata of Bounded Width [PDF]
, 2016 While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master
Chatterjee, Krishnendu +2 more
core +12 more sources
Weighted tree automata and weighted logics
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Droste, Manfred, Vogler, Heiko
openaire +3 more sources
Coalgebras for Bisimulation of Weighted Automata over Semirings [PDF]
Logical Methods in Computer Science, 2023 Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state.
Purandar Bhaduri
doaj +1 more source
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
Nested Weighted Automata [PDF]
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015 Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed ...
Chatterjee, Krishnendu +2 more
openaire +2 more sources
Weighted Automata and Weighted Logics [PDF]
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Droste, Manfred, Gastin, Paul
openaire +3 more sources
Weighted Tree Automata with Constraints
Theory of Computing Systems, 2022 AbstractThe HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open for regular weighted tree languages.
Maletti, Andreas, Nász, Andreea-Teodora
openaire +3 more sources
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
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