Results 51 to 60 of about 1,475,237 (325)
Robust Weighted Timed Automata and Games [PDF]
, 2013 Weighted timed automata extend timed automata with cost variables that can be used to model the evolution of various quantities. Although cost-optimal reachability is decidable (in polynomial space) on this model, it becomes undecidable on weighted ...
Markey, Nicolas +5 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
Initial-state detectability and initial-state opacity of unambiguous weighted automata
at - Automatisierungstechnik, 2021 In this paper, we investigate the verification problem of initial-state detectability (I-detectability) and initial-state opacity (I-opacity) in discrete event systems modeled by unambiguous weighted automata.
Aiwen Lai, S. Lahaye, Zhi-Wu Li
semanticscholar +1 more source
Alternating Weighted Automata [PDF]
, 2009 Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r.
Chatterjee, Krishnendu +2 more
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.
Andreas Maletti, Andreea-Teodora Nász
openaire +6 more sources
Learning Weighted Automata over Number Rings, Concretely and Categorically [PDF]
Logic in Computer ScienceWe develop a generic reduction procedure for active learning problems. Our approach is inspired by a recent polynomial-time reduction of the exact learning problem for weighted automata over integers to that for weighted automata over rationals (Buna ...
Quentin Aristote +3 more
semanticscholar +1 more source
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
Distillation of weighted automata from recurrent neural networks using a spectral approach [PDF]
Machine-mediated learning, 2020 This paper is an attempt to bridge the gap between deep learning and grammatical inference. Indeed, it provides an algorithm to extract a (stochastic) formal language from any recurrent neural network trained for language modelling.
Rémi Eyraud, S. Ayache
semanticscholar +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
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 ...
Kui-Ze Zhang
semanticscholar +1 more source