{"_buckets": {"deposit": "5acfe6b2-8800-4771-b8f7-2df44a59bd72"}, "_deposit": {"id": "30863", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "30863"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00030863", "sets": []}, "author_link": ["102190", "102191", "102192"], "item_9_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1982-10-30", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "1", "bibliographicPageEnd": "148", "bibliographicPageStart": "139", "bibliographicVolumeNumber": "34", "bibliographic_titles": [{"bibliographic_title": "Memoirs of the Faculty of Engineering, Nagoya University"}]}]}, "item_9_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "In this paper we introduce a probabilistic tree automaton by extending the notion of a tree automaton. Let A be a probabilistic tree automaton and RT(A;\u03bb) be a congruence relation defined by a tree language T(A;\u03bb) which a probabilistic tree automaton A accepts with a cut-point \u03bb, 0\u2264\u03bb\u003c1. We prove that if \u03bb is an isolated cut-point then the number of equivalence classes of RT(A;\u03bb) is finite, that is, T(A;\u03bb) is regular.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_9_identifier_registration": {"attribute_name": "ID\u767b\u9332", "attribute_value_mlt": [{"subitem_identifier_reg_text": "10.18999/memfenu.34.1.139", "subitem_identifier_reg_type": "JaLC"}]}, "item_9_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "Faculty of Engineering, Nagoya University"}]}, "item_9_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_9_source_id_7": {"attribute_name": "ISSN\uff08print\uff09", "attribute_value_mlt": [{"subitem_source_identifier": "0027-7657", "subitem_source_identifier_type": "PISSN"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Sugino, Kazue", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "102190", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Inagaki, Yasuyoshi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "102191", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Fukumura, Teruo", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "102192", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-11-16"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "34-1-05.pdf", "filesize": [{"value": "565.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 565100.0, "url": {"label": "34-1-05.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/30863/files/34-1-05.pdf"}, "version_id": "0005cc93-0f1a-4ef7-9ad3-ef094eefb2f8"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Tree language accepted by probabilistic tree automaton with isolated cut-point", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Tree language accepted by probabilistic tree automaton with isolated cut-point", "subitem_title_language": "en"}]}, "item_type_id": "9", "owner": "1", "path": ["320/2524/2544/2584"], "permalink_uri": "https://doi.org/10.18999/memfenu.34.1.139", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2020-11-16"}, "publish_date": "2020-11-16", "publish_status": "0", "recid": "30863", "relation": {}, "relation_version_is_last": true, "title": ["Tree language accepted by probabilistic tree automaton with isolated cut-point"], "weko_shared_id": -1}