Results 51 to 60 of about 842,589 (329)
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
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.
Andreas Maletti, Andreea-Teodora Nász
openaire +3 more sources
Performance analysis of probabilistic timed automata using digital clocks [PDF]
, 2006 Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a modelling formalism suitable for describing formally both nondeterministic and probabilistic aspects of real-time systems, and is amenable to
Kwiatkowska, M. +3 more
core +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
Integer Weighted Automata on Infinite Words [PDF]
, 2023 In this paper we combine two classical generalisations of finite automata (weighted automata and automata on infinite words) into a model of integer weighted automata on infinite words and study the universality and the emptiness problems under zero ...
Harju, T +3 more
core +2 more sources
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
Weighted Automata and Monadic Second Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Let S be a commutative semiring. M. Droste and P. Gastin have introduced in 2005 weighted monadic second order logic WMSOL with weights in S. They use a syntactic fragment RMSOL of WMSOL to characterize word functions (power series) recognizable by ...
Nadia Labai, Johann A. Makowsky
doaj +1 more source
Quantum Finite Automata and Weighted Automata
J. Autom. Lang. Comb., 2007 10 pages, Preliminary version appears in the Proceedings of ACiD-2005, Texts in Algorithmics series of KCL publications, pp.
M. V. Panduranga Rao, V. Vinay
openaire +2 more sources
Detectability of labeled weighted automata over monoids [PDF]
Discrete event dynamic systems, 2020 In this paper, by developing appropriate methods, we for the first time obtain characterization of four fundamental notions of detectability for general labeled weighted automata over monoids (denoted by AM\documentclass[12pt]{minimal} \usepackage ...
Kuize Zhang
semanticscholar +1 more source
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