Learning weighted automata over principal ideal domains
From MaRDI portal
Publication:2200852
DOI10.1007/978-3-030-45231-5_31zbMath1461.68093arXiv1911.04404OpenAlexW3023251497MaRDI QIDQ2200852
Gerco van Heerdt, Alexandra Silva, Clemens Kupke, Jurriaan Rot
Publication date: 23 September 2020
Full work available at URL: https://arxiv.org/abs/1911.04404
Hankel matrixprincipal ideal domainactive learningMAT learningweighted automatonobservation-table learning
Related Items (4)
Learning of Structurally Unambiguous Probabilistic Grammars ⋮ Combining semilattices and semimodules ⋮ Learning pomset automata ⋮ A categorical framework for learning generalised tree automata
Cites Work
- Unnamed Item
- Unnamed Item
- Learning regular sets from queries and counterexamples
- Matrices de Hankel
- Parametrized recurrent systems for image generation
- The design principles of a weighted finite-state transducer library
- On the learnability of infinitary regular sets
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Realizations by stochastic finite automata
- Learning Register Automata with Fresh Value Generation
- Learning Weighted Automata
- Formal Analysis of Online Algorithms
- Weighted Bisimulation in Linear Algebraic Form
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Learning nominal automata
- Onto Endomorphisms are Isomorphisms
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
This page was built for publication: Learning weighted automata over principal ideal domains
