Polynomial-time identification of very simple grammars from positive data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
IEICE - Transactions on Information and Systems
A unified algorithm for extending classes of languages identifiable in the limit from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
A NOTE ON THE GRAMMATICAL INFERENCE PROBLEM FOR EVEN LINEAR LANGUAGES
Fundamenta Informaticae
Hi-index | 0.89 |