scientific article; zbMATH DE number 7649925

DOI10.4230/LIPIcs.CONCUR.2019.17MaRDI QIDQ5875378

Jan Otop, Jakub Michaliszyn

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1906.11104

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

learningexpected valueweighted automata

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Learning infinite-word automata with loop-index queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular omega languages
• Handbook of weighted automata
• Learning regular sets from queries and counterexamples
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Inferring regular languages and \(\omega\)-languages
• Generalization bounds for learning weighted automata
• Model measuring for discrete and hybrid systems
• Learning a Random DFA from Uniform Strings and State Information
• On the Rademacher Complexity of Weighted Automata
• Quantitative abstraction refinement
• Quantitative languages
• Temporal Specifications with Accumulative Values
• Learning Weighted Automata
• The Cost of Traveling between Languages
• Averaging in LTL
• Learning Multiplicity Tree Automata
• The minimum consistent DFA problem cannot be approximated within any polynomial
• Complexity of automaton identification from given data
• Cryptographic limitations on learning Boolean formulae and finite automata
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• Quantitative Automata under Probabilistic Semantics
• Non-deterministic Weighted Automata on Random Words
• Learning nominal automata

This page was built for publication: