| 模糊树自动机语言的封闭性 |
| |
| 引用本文： | 王泽文,舒兰,翁福利.模糊树自动机语言的封闭性[J].计算机工程与应用,2012,48(18):61-63. |
| |
| 作者姓名： | 王泽文 舒兰 翁福利 |
| |
| 作者单位： | 电子科技大学 数学科学学院，成都 611731 |
| |
| 摘 要： | 给出了Σ-]代数、Σ-]树、模糊Σ-]树自动机、模糊Σ-]树自动机行为的定义。引入了模糊树自动机语言的并、交、连接和Kleene闭包运算，证明了在这些运算下模糊树自动机语言的封闭性。
|
| 关 键 词： | 树 模糊集 模糊树自动机 Kleene闭包 |
Closure of fuzzy tree automaton languages. |
| |
| WANG Zewen
,
SHU Lan
,
WENG Fuli.Closure of fuzzy tree automaton languages.[J].Computer Engineering and Applications,2012,48(18):61-63. |
| |
| Authors: | WANG Zewen SHU Lan WENG Fuli |
| |
| Affiliation: | School of Mathematical Science, University of Electronic Science and Technology of China, Chengdu 611731, China |
| |
| Abstract: | The notions of Σ-algebra,Σ-tree,fuzzy Σ-tree automaton,the behavior of fuzzy Σ-tree automaton are given.The union,intersection,concatenation,Kleene closure of fuzzy tree automaton languages are introduced,and the closure of fuzzy tree automata languages under these operations is proved. |
| |
| Keywords: | tree fuzzy set fuzzy tree automata Kleene closure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
