On the Teaching Complexity of Linear Sets

DOI10.1007/978-3-319-24486-0_7zbMath1388.68149OpenAlexW2265598218MaRDI QIDQ2835620

Sandra Zilles, Hans Ulrich Simon, Ziyuan Gao

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24486-0_7

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

On the teaching complexity of linear sets

Cites Work

• Unnamed Item
• Unnamed Item
• Limitations of self-assembly at temperature 1
• Teachability in computational learning
• Numerical semigroups.
• Learning semilinear sets from examples and via queries
• Catalytic P systems, semilinear sets, and vector addition systems
• On the complexity of teaching
• Inductive inference of formal languages from positive data
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Distinguishing Pattern Languages with Membership Examples
• On Context-Free Languages

This page was built for publication: On the Teaching Complexity of Linear Sets