Learning semilinear sets from examples and via queries

DOI10.1016/0304-3975(92)90123-WzbMath0754.68098MaRDI QIDQ1200804

Yuji Takada

Publication date: 16 January 1993

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

zbMATH Keywords

parallel computation modelsintractability of learning from exampleslearnabilities from positive examples

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (4)

Learning union of integer hypercubes with queries (with applications to monadic decomposition) ⋮ On the teaching complexity of linear sets ⋮ On the Teaching Complexity of Linear Sets ⋮ Even linear simple matrix languages: formal language properties and grammatical inference.

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On weak persistency of Petri nets
• On structural conditions for weak persistency and semilinearity of Petri nets
• Queries and concept learning
• Rational sets in commutative monoids
• Using string languages to describe picture languages
• Inductive inference of formal languages from positive data
• Petri nets and szilard languages
• Bounded Algol-Like Languages
• On equal matrix languages
• Simple matrix languages
• Language identification in the limit

This page was built for publication: Learning semilinear sets from examples and via queries