Computational limits on team identification of languages

DOI10.1006/INCO.1996.0081MaRDI QIDQ675220zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, A. K. Sharma

Publication date 13 October 1997

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

Full work available at URL https://semanticscholar.org/paper/2bc849561f717a3cc0d5847e82725b375c49bfb6

zbMATH Keywords

learning machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Language learning by a team
• On aggregating teams of learning machines
• Finite identification of functions by teams with success ratio 12 and above

Cited in

(10)

• On aggregating teams of learning machines
• Finite identification of functions by teams with success ratio 12 and above
• On the amount of nonconstructivity in learning formal languages from text
• Language learning by a team
• Closedness properties in EX-identification of recursive functions
• Probabilistic inductive inference: A survey
• Probabilistic language learning under monotonicity constraints
• Input-dependence in function-learning
• Probabilistic and team PFIN-type learning: General properties
• Taming teams with mind changes

This page was built for publication: Computational limits on team identification of languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675220)