{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00059600","sets":["5471:5474:5475"]},"path":["5475"],"owner":"1","recid":"59600","title":["Polynomial-time MAT Learning of C-Deterministic Context-free Grammars"],"pubdate":{"attribute_name":"公開日","attribute_value":"1993-03-31"},"_buckets":{"deposit":"40abb5ec-c78c-4daa-98c0-f65c78600a6b"},"_deposit":{"id":"59600","pid":{"type":"depid","value":"59600","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Polynomial-time MAT Learning of C-Deterministic Context-free Grammars","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Polynomial-time MAT Learning of C-Deterministic Context-free Grammars"},{"subitem_title":"Polynomial-time MAT Learning of C-Deterministic Context-free Grammars","subitem_title_language":"en"}]},"item_type_id":"5","publish_date":"1993-03-31","item_5_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Informatics  Sanno College"},{"subitem_text_value":"Department of Computer Science and Information  Mathematics  University of Electro-Communications"}]},"item_5_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Informatics, Sanno College","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Information  Mathematics, University of Electro-Communications","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/59600/files/IPSJ-JIP15EX006.pdf"},"date":[{"dateType":"Available","dateValue":"1995-03-31"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JIP15EX006.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"db631cd3-ac68-43ba-b428-2b303c6f5a2f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1993 by the Information Processing Society of Japan"}]},"item_5_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiromi, Shirakawa"},{"creatorName":"Takashi, Yokomori"}],"nameIdentifiers":[{}]}]},"item_5_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiromi, Shirakawa","creatorNameLang":"en"},{"creatorName":"Takashi, Yokomori","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_5_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA00700121","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_5_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-6652","subitem_source_identifier_type":"ISSN"}]},"item_5_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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).","subitem_description_type":"Other"}]},"item_5_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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).","subitem_description_type":"Other"}]},"item_5_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"52","bibliographic_titles":[{"bibliographic_title":"Journal of Information Processing "}],"bibliographicPageStart":"42","bibliographicIssueDates":{"bibliographicIssueDate":"1993-03-31","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"EX","bibliographicVolumeNumber":"15"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T03:30:35.107284+00:00","created":"2025-01-18T23:22:20.485329+00:00","links":{},"id":59600}