| 接受非本原字自动机的方根（T（A））~（1/2）的上界值问题 |
| |
| 引用本文： | 龙冬阳.接受非本原字自动机的方根（T（A））~（1/2）的上界值问题[J].中山大学学报论丛,1996(6). |
| |
| 作者姓名： | 龙冬阳 |
| |
| 作者单位： | 中山大学计算机科学系 |
| |
| 摘 要： | 给出了Ｉｔｏ等人所讨论的接受本原字的有限自动机的判定问题、及提出接受非本原字自动机的方根Ｔ（Ａ）的上界值问题的部分解答
|
| 关 键 词： | 有限自动机，本原字，形式语言 |
On the Upper Bound Value of T (A) |
| |
| Long Dongyang.On the Upper Bound Value of T (A)[J].Supplement to the Journal of Sun Yatsen University,1996(6). |
| |
| Authors: | Long Dongyang |
| |
| Institution: | Long DongyangDepartment of Computer Science,Zhongshan University,Guangzhou 510275 |
| |
| Abstract: | Decision Algorithms for automata accepting primitive words are given, at the same time, an open problem is posed: determine the upper bound value of T (A), where A is an automata accepting non-primitive words. In this note, some results of this problem are given. |
| |
| Keywords: | finite automata primitive words languages |
| 本文献已被 CNKI 等数据库收录！ |
