Results 61 to 70 of about 842,589 (329)
Applications in Enumerative Combinatorics of In finite Weighted Automata and Graphs [PDF]
Scientific Annals of Computer Science, 2014 In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted
R. De Castro, A. Ramírez, J.L. Ramírez
doaj +1 more source
On the Disambiguation of Weighted Automata [PDF]
, 2015 We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a detailed description of the algorithm and the proof of its correctness.
Mehryar Mohri, Michael D. Riley
openaire +2 more sources
Integer Weighted Automata on Infinite Words [PDF]
, 2021 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 ...
Tero Harju +7 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
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 +2 more sources
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
Connecting weighted automata, tensor networks and recurrent neural networks through spectral learning [PDF]
Machine-mediated learning, 2020 In this paper, we present connections between three models used in different research fields: weighted finite automata (WFA) from formal languages and linguistics, recurrent neural networks used in machine learning, and tensor networks which encompasses ...
Tianyu Li +2 more
semanticscholar +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
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
Degree of Sequentiality of Weighted Automata [PDF]
, 2017 35 ...
Laure Daviaud +3 more
openaire +5 more sources