scientific article; zbMATH DE number 7802073

zbMath1530.68129arXiv2209.10315MaRDI QIDQ6191009

Martin Leucker, Serge Haddad, Benedikt Bollig, Lina Ye, Rajarshi Roy, Daniel Neider, Benoît Barbot, Igor Khmelnitsky

Publication date: 8 February 2024

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

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

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Learning regular sets from queries and counterexamples
• Efficient noise-tolerant learning from statistical queries
• Introduction to Discrete Event Systems
• A theory of the learnable
• Approximate language identification
• Complexity of automaton identification from given data
• Probability Inequalities for Sums of Bounded Random Variables