Learning expressions and programs over monoids

DOI10.1016/J.IC.2005.09.003MaRDI QIDQ2490112zbMATH OpenOpenAlexFDO

Authors Ricard Gavaldà, Pascal Tesson, Denis Thérien

Publication date 28 April 2006

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2005.09.003

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1688371
• An Algebraic Perspective on Boolean Function Learning
• scientific article; zbMATH DE number 1759404
• Programs over aperiodic monoids
• Learning pattern languages over groups

Cites work

• A theory of the learnable
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Finite monoids and the fine structure of NC ¹
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 1223708 (Why is no real title available?)
• scientific article; zbMATH DE number 618821 (Why is no real title available?)
• scientific article; zbMATH DE number 1944133 (Why is no real title available?)
• scientific article; zbMATH DE number 1962825 (Why is no real title available?)
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Learning functions represented as multiplicity automata
• Learning matrix functions over rings
• Learning regular sets from queries and counterexamples
• Non-uniform automata over groups
• Oracles and queries that are sufficient for exact learning
• Programs over aperiodic monoids
• Queries and concept learning
• Superlinear lower bounds for bounded-width branching programs
• Sur le produit de concatenation non ambigu
• The Complexity of Enumeration and Reliability Problems
• The complexity of solving equations over finite groups
• The membership problem in aperiodic transformation monoids
• When won't membership queries help?

Cited in

(5)

• scientific article; zbMATH DE number 1688371 (Why is no real title available?)
• An Algebraic Perspective on Boolean Function Learning
• scientific article; zbMATH DE number 1301799 (Why is no real title available?)
• Learning algebraic structures from text
• Hardness of learning loops, monoids, and semirings

This page was built for publication: Learning expressions and programs over monoids

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