scientific article; zbMATH DE number 2019600

MaRDI QIDQ4440392zbMATH OpenFDO

Authors Colin de la Higuera, Jose Oncina

Publication date 17 December 2003

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Polynomial-time identification of very simple grammars from positive data.
• Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
• Learning Efficiency of Very Simple Grammars from Positive Data
• Learning efficiency of very simple grammars from positive data
• Identification with probability one of stochastic deterministic linear languages

Cited in

(8)

• Characteristic sets for polynomial grammatical inference
• Polynomial-time identification of very simple grammars from positive data.
• Learning Efficiency of Very Simple Grammars from Positive Data
• Identification in the Limit of k,l-Substitutable Context-Free Languages
• Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
• scientific article; zbMATH DE number 1301802 (Why is no real title available?)
• Polynomial characteristic sets for \(DFA\) identification
• Identification with probability one of stochastic deterministic linear 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 Q4440392)