Weighted Automata Algorithms
From MaRDI portal
Publication:5072548
DOI10.1007/978-3-642-01492-5_6zbMath1484.68092OpenAlexW1629199664WikidataQ72421627 ScholiaQ72421627MaRDI QIDQ5072548
Publication date: 28 April 2022
Published in: Monographs in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.1601
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)
Related Items (21)
A Disambiguation Algorithm for Finite Automata and Functional Transducers ⋮ Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers ⋮ Learning Weighted Automata ⋮ Bideterministic weighted automata ⋮ Generalization bounds for learning weighted automata ⋮ Nondeterministic Moore automata and Brzozowski's minimization algorithm ⋮ Unnamed Item ⋮ Spectral learning of weighted automata. A forward-backward perspective ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Unnamed Item ⋮ Weighted automata are compact and actively learnable ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Weighted finite automata with output ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring ⋮ Weighted automata ⋮ Diagnosis and Automata ⋮ Compositions of (max,+) automata ⋮ Characterizing weighted MSO for trees by branching transitive closure logics
This page was built for publication: Weighted Automata Algorithms