Results 71 to 80 of about 1,475,237 (325)
What’s decidable about weighted automata [PDF]
, 2011 . Weighted automata map input words to numerical values. Ap-plications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing.
Shaull Almagor +5 more
core +1 more source
PAWS: A Tool for the Analysis of Weighted Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 PAWS is a tool to analyse the behaviour of weighted automata and conditional transition systems. At its core PAWS is based on a generic implementation of algorithms for checking language equivalence in weighted automata and bisimulation in conditional ...
Barbara König +2 more
doaj +1 more source
Weighted Regular Tree Grammars with Storage [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids.
Zoltán Fülöp +2 more
doaj +1 more source
Algorithms for Weighted Pushdown Automata
Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, 2022 Weighted pushdown automata (WPDAs) are at the core of many natural language processing tasks, like syntax-based statistical machine translation and transition-based dependency parsing. As most existing dynamic programming algorithms are designed for context-free grammars (CFGs), algorithms for PDAs often resort to a PDA-to-CFG conversion. In this paper,
Alexandra Butoi +4 more
openaire +4 more sources
Weighted Pushdown Systems with Indexed Weight Domains [PDF]
Logical Methods in Computer Science, 2016 The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing ...
Yasuhiko Minamide
doaj +1 more source
Learning Weighted Automata over Principal Ideal Domains [PDF]
Foundations of Software Science and Computation Structure, 2019 In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin’s seminal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
Gerco van Heerdt +3 more
semanticscholar +1 more source
Weighted automata with storage
Information and Computation, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luisa Herrmann 0001 +2 more
openaire +2 more sources
Weighted automata are compact and actively learnable [PDF]
Information Processing Letters, 2020 We show that weighted automata over the field of two elements can be exponentially more compact than non-deterministic finite state automata. To show this, we combine ideas from automata theory and communication complexity. However, weighted automata are
Artem Kaznatcheev, P. Panangaden
semanticscholar +1 more source
Degree of Sequentiality of Weighted Automata [PDF]
, 2017 35 ...
Laure Daviaud +3 more
openaire +6 more sources
Model Checking One-clock Priced Timed Automata [PDF]
Logical Methods in Computer Science, 2008 We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer +2 more
doaj +1 more source