Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data

DOI10.1007/11872436_5zbMath1158.68418OpenAlexW1834060854MaRDI QIDQ3541844

Ryo Yoshinaka

Publication date: 27 November 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11872436_5

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Related Items (3)

Learning Efficiency of Very Simple Grammars from Positive Data ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Learning efficiency of very simple grammars from positive data

This page was built for publication: Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data