scientific article; zbMATH DE number 2019609

MaRDI QIDQ4440403zbMATH OpenFDO

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

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)

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; zbMATH DE number 67617
• PAC learning with simple examples

Cited in

(10)

• PAC-Learning Unambiguous NTS Languages
• scientific article; zbMATH DE number 1670730 (Why is no real title available?)
• On the learnability of shuffle ideals
• On the learnability of shuffle ideals
• scientific article; zbMATH DE number 6160572 (Why is no real title available?)
• scientific article; zbMATH DE number 67617 (Why is no real title available?)
• On the regularity and learnability of ordered DAG languages
• Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
• Polynomial time learning of simple deterministic languages via queries and a representative sample
• scientific article; zbMATH DE number 1839442 (Why is no real title available?)

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)