A GRAMMATICAL INFERENCE FOR CONTEXT-FREE LANGUAGES BASED ON SELF-EMBEDDING - Collections

＜journal article＞
A GRAMMATICAL INFERENCE FOR CONTEXT-FREE LANGUAGES BASED ON SELF-EMBEDDING

Creator	Creator Name Tanatsugu, Keisuke 棚次, 奎介 Affiliation Affiliation Name Department of Mathematics, Kitakyushu University 北九州大学
Language	English
Publisher	Research Association of Statistical Sciences
Publisher	統計科学研究会
Date	1987-03
Source Title	Bulletin of informatics and cybernetics
Vol	22
Issue	3/4
First Page	149
Last Page	163
Publication Type	Version of Record
Access Rights	open access
Crossref DOI	https://doi.org/10.5109/13382
Related DOI	Bulletin of informatics and cybernetics \|\| 22(3/4) \|\| p149-163
Related DOI	http://bic.math.kyushu-u.ac.jp/
Related URI	Bulletin of informatics and cybernetics \|\| 22(3/4) \|\| p149-163
Related URI	http://bic.math.kyushu-u.ac.jp/
Relation	Bulletin of informatics and cybernetics \|\| 22(3/4) \|\| p149-163
Relation	http://bic.math.kyushu-u.ac.jp/
Abstract	Our purpose in this paper is to construct a practical algorithm to inductively infer context-free languages. A basic procedure is first introduced to take out the self-embedding structure from given s...trings. Secondly, based on this procedure an algorithm to infer linear grammars from given finite sample sets is presented and its completeness is proved. Finally, by using a method to compose linear grammars, we propose an algorithm which is also complete for context-free languages.show more

File	FileType	Size	Views	Description
p149	pdf	663 KB	410