@article{oai:ipsj.ixsq.nii.ac.jp:00059600,
 author = {Hiromi, Shirakawa and Takashi, Yokomori and Hiromi, Shirakawa and Takashi, Yokomori},
 issue = {EX},
 journal = {Journal of Information Processing},
 month = {Mar},
 note = {This paper concerns the learning of context-free grammars  and introduces a subclass which we call context-deterministic (c-deterministic) grammars. The corresponding language class properly contains the classes or regular languages and of even linear languages  and is incomparable to the classes or simple deterministic languages and of one-counter languages. We show that the class of c-deterministic grammars is learnable in polynomial time from (extended) minimally adequate teacher (MAT). which gives a generalization of the corresponding results on regular languages in Ref 3) and even-linear languages in Ref.9)., This paper concerns the learning of context-free grammars, and introduces a subclass which we call context-deterministic (c-deterministic) grammars. The corresponding language class properly contains the classes or regular languages and of even linear languages, and is incomparable to the classes or simple deterministic languages and of one-counter languages. We show that the class of c-deterministic grammars is learnable in polynomial time from (extended) minimally adequate teacher (MAT). which gives a generalization of the corresponding results on regular languages in Ref 3) and even-linear languages in Ref.9).},
 pages = {42--52},
 title = {Polynomial-time MAT Learning of C-Deterministic Context-free Grammars},
 volume = {15},
 year = {1993}
}