Characterizing PAC-learnability of semilinear sets

DOI10.1006/INCO.1995.1006zbMath0818.68124OpenAlexW2075333420MaRDI QIDQ1346716

Naoki Abe

Publication date: 10 April 1995

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

Full work available at URL: https://semanticscholar.org/paper/35dc6b9690f8969edb45634e22e411d02dfab492

zbMATH Keywords

reducibilityregular languageslearnability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Learning union of integer hypercubes with queries (with applications to monadic decomposition) ⋮ Regular inference as vertex coloring ⋮ Automata, Boolean matrices, and ultimate periodicity.

This page was built for publication: Characterizing PAC-learnability of semilinear sets