INFERRING UNIONS OF TWO PATTERN LANGUAGES - Collections

＜journal article＞
INFERRING UNIONS OF TWO PATTERN LANGUAGES

Creator	Creator Name Shinohara, Takeshi 篠原, 武 Affiliation Affiliation Name Computer Center, Kyushu University 九州大学大型計算機センター
Language	English
Publisher	Research Association of Statistical Sciences
Publisher	統計科学研究会
Date	1983-03
Source Title	Bulletin of informatics and cybernetics
Vol	20
Issue	3/4
First Page	83
Last Page	88
Publication Type	Version of Record
Access Rights	open access
Crossref DOI	https://doi.org/10.5109/13347
Related DOI	Bulletin of informatics and cybernetics \|\| 20(3/4) \|\| p83-88
Related DOI	http://bic.math.kyushu-u.ac.jp/
Related URI	Bulletin of informatics and cybernetics \|\| 20(3/4) \|\| p83-88
Related URI	http://bic.math.kyushu-u.ac.jp/
Relation	Bulletin of informatics and cybernetics \|\| 20(3/4) \|\| p83-88
Relation	http://bic.math.kyushu-u.ac.jp/
Abstract	A pattern is a string of constant symbols and variable symbols. The language $ L(p) $ of a pattern $ p $ is the set of all strings obtained by substituting any non-empty constant string for each varia...ble symbol in $ p $. In this paper we consider inference from positive data for unions of two pattern languages, that is, identification of $ L(p) smile L(q) $ when an enumeration of elements in the union is given.show more

File	FileType	Size	Views	Description
p083	pdf	330 KB	556