Results 41 to 50 of about 842,589 (329)
Pushing for weighted tree automata [PDF]
Logical Methods in Computer Science, 2018 A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it is most useful ...
Thomas Hanneforth +2 more
doaj +1 more source
Decision-Guided Weighted Automata Extraction from Recurrent Neural Networks
AAAI Conference on Artificial Intelligence, 2021 Recurrent Neural Networks (RNNs) have demonstrated their effectiveness in learning and processing sequential data (e.g., speech and natural language). However, due to the black-box nature of neural networks, understanding the decision logic of RNNs is ...
Xiyue Zhang +5 more
semanticscholar +1 more source
Weighted omega-Restricted One Counter Automata [PDF]
Logical Methods in Computer Science, 2018 Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a ...
Manfred Droste, Werner Kuich
doaj +1 more source
Weight Annotation in Information Extraction [PDF]
Logical Methods in Computer Science, 2022 The framework of document spanners abstracts the task of information extraction from text as a function that maps every document (a string) into a relation over the document's spans (intervals identified by their start and end indices). For instance, the
Johannes Doleschal +3 more
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, Zhiwu Li
semanticscholar +1 more source
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
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 +2 more sources
Robustness in Timed Automata [PDF]
, 2013 In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors.
Markey, Nicolas +7 more
core +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