Approximate learning of limit-average automata

DOI10.4230/LIPICS.CONCUR.2019.17MaRDI QIDQ5875378zbMATH OpenFDO

Authors Jakub Michaliszyn, Jan Otop

Publication date 3 February 2023

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

zbMATH Keywords

learningexpected valueweighted automata

Mathematics Subject Classification ID

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

Recommendations

• Efficient learning of typical finite automata from random walks
• Learning deterministic automata on infinite words
• Weighted automata are compact and actively learnable
• Grammatical Inference: Algorithms and Applications
• Approximate determinization of quantitative automata

Cites work

• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Averaging in LTL
• Complexity of automaton identification from given data
• Complexity of equivalence and learning for multiplicity tree automata
• Cryptographic limitations on learning Boolean formulae and finite automata
• Generalization bounds for learning weighted automata
• Grammatical inference. Learning automata and grammars.
• Handbook of weighted automata
• Inferring regular languages and \(\omega\)-languages
• Learning Multiplicity Tree Automata
• Learning a Random DFA from Uniform Strings and State Information
• Learning nominal automata
• Learning regular omega languages
• Learning regular sets from queries and counterexamples
• Learning weighted automata
• Model measuring for discrete and hybrid systems
• Non-deterministic Weighted Automata on Random Words
• On the Rademacher complexity of weighted automata
• Quantitative abstraction refinement
• Quantitative languages
• Temporal specifications with accumulative values
• The Cost of Traveling between Languages
• The minimum consistent DFA problem cannot be approximated within any polynomial

Cited in

(3)

• Learning infinite-word automata with loop-index queries
• Generalization bounds for learning weighted automata
• Efficient learning of typical finite automata from random walks

This page was built for publication: Approximate learning of limit-average automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875378)