On Conservative Learning of Recursively Enumerable Languages

DOI10.1007/978-3-642-39053-1_21zbMath1387.68139OpenAlexW59603661MaRDI QIDQ5326368

Sanjay Jain, Ziyuan Gao, Frank Stephan

Publication date: 5 August 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_21

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (5)

Intrinsic complexity of partial learning ⋮ Partial learning of recursively enumerable languages ⋮ Intrinsic Complexity of Partial Learning ⋮ Combining Models of Approximation with Partial Learning ⋮ On the role of update constraints and text-types in iterative learning

This page was built for publication: On Conservative Learning of Recursively Enumerable Languages