scientific article; zbMATH DE number 2019594
From MaRDI portal
Publication:4440386
zbMATH Open1028.68111MaRDI QIDQ4440386
Publication date: 17 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2484/24840049.htm
Title of this publication is not available (Why is that?)
Learning and adaptive systems in artificial intelligence (68T05) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Natural language processing (68T50)
Related Items (3)
Polynomial-time identification of very simple grammars from positive data. ⋮ Title not available (Why is that?) ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions
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 Q4440386)
