On the teaching complexity of linear sets

DOI10.1016/j.tcs.2017.11.024zbMath1388.68150OpenAlexW2774221743MaRDI QIDQ1704564

Hans Ulrich Simon, Ziyuan Gao, Sandra Zilles

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.11.024

zbMATH Keywords

linear setsteaching dimensionrecursive teaching dimensionteaching complexity

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

Finitely distinguishable erasing pattern languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limitations of self-assembly at temperature 1
• Teachability in computational learning
• Teaching a smarter learner.
• Numerical semigroups.
• Finding patterns common to a set of strings
• On weak persistency of Petri nets
• On structural conditions for weak persistency and semilinearity of Petri nets
• Learning semilinear sets from examples and via queries
• Catalytic P systems, semilinear sets, and vector addition systems
• On the complexity of teaching
• Distinguishing pattern languages with membership examples
• On the Teaching Complexity of Linear Sets
• Order Compression Schemes
• Linear extensions of partial orders and reverse mathematics
• 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
• On equal matrix languages
• On numerical semigroups

This page was built for publication: On the teaching complexity of linear sets