Inductive Inference of Context-Free Languages - Context-Free Expression Method
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.
Cite
Text
Yokomori. "Inductive Inference of Context-Free Languages - Context-Free Expression Method." International Joint Conference on Artificial Intelligence, 1987.Markdown
[Yokomori. "Inductive Inference of Context-Free Languages - Context-Free Expression Method." International Joint Conference on Artificial Intelligence, 1987.](https://mlanthology.org/ijcai/1987/yokomori1987ijcai-inductive/)BibTeX
@inproceedings{yokomori1987ijcai-inductive,
title = {{Inductive Inference of Context-Free Languages - Context-Free Expression Method}},
author = {Yokomori, Takashi},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1987},
pages = {283-286},
url = {https://mlanthology.org/ijcai/1987/yokomori1987ijcai-inductive/}
}