scientific article; zbMATH DE number 67617

MaRDI QIDQ4013535zbMATH OpenFDO

Authors Hiroki Ishizaka

Publication date 27 September 1992

zbMATH Keywords

equivalence querieslanguage learningmodel inferencecontext- free grammarGreibach normal formsimple deterministic languages1-state deterministic push-down automatonsimple deterministic grammar

Mathematics Subject Classification ID

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

Recommendations

• Polynomial time learning of simple deterministic languages via queries and a representative sample
• scientific article; zbMATH DE number 1670730
• scientific article; zbMATH DE number 2019609
• Even linear simple matrix languages: formal language properties and grammatical inference.
• scientific article; zbMATH DE number 2089362

Cited in

(11)

• scientific article; zbMATH DE number 1670730 (Why is no real title available?)
• A framework for polynomial-time query learnability
• Polynomial time learning of simple deterministic languages via queries and a representative sample
• scientific article; zbMATH DE number 2019609 (Why is no real title available?)
• scientific article; zbMATH DE number 2089362 (Why is no real title available?)
• Inductive logic programming
• On the complexity of small description and related topics
• Synthesis of real time acceptors
• Learning Deterministic DEC Grammars Is Learning Rational Numbers
• Inference of deterministic one-counter languages
• Learning languages and functions by erasing

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 Q4013535)