WEKO3
アイテム
Tree language accepted by probabilistic tree automaton with isolated cut-point
https://doi.org/10.18999/memfenu.34.1.139
https://doi.org/10.18999/memfenu.34.1.139be70b291-b27c-4506-a796-3f50ae44395c
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2020-11-16 | |||||
タイトル | ||||||
タイトル | Tree language accepted by probabilistic tree automaton with isolated cut-point | |||||
言語 | en | |||||
著者 |
Sugino, Kazue
× Sugino, Kazue× Inagaki, Yasuyoshi× Fukumura, Teruo |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
抄録 | ||||||
内容記述 | 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;λ) be a congruence relation defined by a tree language T(A;λ) which a probabilistic tree automaton A accepts with a cut-point λ, 0≤λ<1. We prove that if λ is an isolated cut-point then the number of equivalence classes of RT(A;λ) is finite, that is, T(A;λ) is regular. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
出版者 | ||||||
言語 | en | |||||
出版者 | Faculty of Engineering, Nagoya University | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | departmental bulletin paper | |||||
出版タイプ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
ID登録 | ||||||
ID登録 | 10.18999/memfenu.34.1.139 | |||||
ID登録タイプ | JaLC | |||||
ISSN(print) | ||||||
収録物識別子タイプ | PISSN | |||||
収録物識別子 | 0027-7657 | |||||
書誌情報 |
en : Memoirs of the Faculty of Engineering, Nagoya University 巻 34, 号 1, p. 139-148, 発行日 1982-10-30 |
|||||
著者版フラグ | ||||||
値 | publisher |