Inductive Inference of Context-free Languages - Context-free Expression Method
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Knowledge Acquisition. Pages 283-285.
Abstract
An inductive inference problem of context-free languages is investigated. There have been many attempts to this problem, and most of them are based on a problem setting in which a representation space for hypotheses is a class of context-free grammars. An inference algorithm given in this paper , on the contrary, employs a kind of extensions of regular expressions called context-free expressions as a representation space for context-free languages. The algorithm, based on the notion of an identification in the limit, is significantly concise when compared with existing algorithms.
@inproceedings{ijcai1987p58,
title = {Inductive Inference of Context-free Languages - Context-free Expression Method},
author = {Yokomori, Takashi},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {283--285},
year = {1987},
note = {Knowledge Acquisition},
url = {https://ijcai.org/proceedings/1987/58},
}
TY - CPAPER TI - Inductive Inference of Context-free Languages - Context-free Expression Method AU - Yokomori, Takashi T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 283 EP - 285 UR - https://ijcai.org/proceedings/1987/58 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
