scientific article; zbMATH DE number 2019609

zbMATH Open1028.68615MaRDI QIDQ4440403FDOQ4440403

Authors: Yasuhiro Tajima, Matsuaki Terada 

Publication date: 17 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2484/24840249.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1670730
• Polynomial time learning of simple deterministic languages via queries and a representative sample
• Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
• scientific article
• PAC learning with simple examples

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cited In (9)

• Title not available (Why is that?)
• Polynomial time learning of simple deterministic languages via queries and a representative sample
• Title not available (Why is that?)
• On the learnability of shuffle ideals
• Title not available (Why is that?)
• Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
• Title not available (Why is that?)
• PAC-Learning Unambiguous NTS Languages
• On the regularity and learnability of ordered DAG languages

This page was built for publication:

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