WEKO3
-
RootNode
アイテム
Polynomial-time MAT Learning of C-Deterministic Context-free Grammars
https://ipsj.ixsq.nii.ac.jp/records/59600
https://ipsj.ixsq.nii.ac.jp/records/59600ab36c76c-7552-4b64-80fe-58fc817fcef5
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 1993 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | JInfP(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 1993-03-31 | |||||||
タイトル | ||||||||
タイトル | Polynomial-time MAT Learning of C-Deterministic Context-free Grammars | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | Polynomial-time MAT Learning of C-Deterministic Context-free Grammars | |||||||
言語 | ||||||||
言語 | eng | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
資源タイプ | journal article | |||||||
著者所属 | ||||||||
Department of Informatics Sanno College | ||||||||
著者所属 | ||||||||
Department of Computer Science and Information Mathematics University of Electro-Communications | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Informatics, Sanno College | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Computer Science and Information Mathematics, University of Electro-Communications | ||||||||
著者名 |
Hiromi, Shirakawa
× Hiromi, Shirakawa
|
|||||||
著者名(英) |
Hiromi, Shirakawa
× Hiromi, Shirakawa
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | This paper concerns the learning of context-free grammars and introduces a subclass which we call context-deterministic (c-deterministic) grammars. The corresponding language class properly contains the classes or regular languages and of even linear languages and is incomparable to the classes or simple deterministic languages and of one-counter languages. We show that the class of c-deterministic grammars is learnable in polynomial time from (extended) minimally adequate teacher (MAT). which gives a generalization of the corresponding results on regular languages in Ref 3) and even-linear languages in Ref.9). | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | This paper concerns the learning of context-free grammars, and introduces a subclass which we call context-deterministic (c-deterministic) grammars. The corresponding language class properly contains the classes or regular languages and of even linear languages, and is incomparable to the classes or simple deterministic languages and of one-counter languages. We show that the class of c-deterministic grammars is learnable in polynomial time from (extended) minimally adequate teacher (MAT). which gives a generalization of the corresponding results on regular languages in Ref 3) and even-linear languages in Ref.9). | |||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AA00700121 | |||||||
書誌情報 |
Journal of Information Processing 巻 15, 号 EX, p. 42-52, 発行日 1993-03-31 |
|||||||
ISSN | ||||||||
収録物識別子タイプ | ISSN | |||||||
収録物識別子 | 1882-6652 | |||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 情報処理学会 |