Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs

被引:37
|
作者
Iwama, K [1 ]
Kambayashi, Y
Takaki, K
机构
[1] Kyoto Univ, Sch Informat, Kyoto 6068501, Japan
[2] NTT Corp, NTT Long Distance Commun Sector, Tokyo 150, Japan
[3] Kyushu Univ, Fukuoka 812, Japan
关键词
D O I
10.1016/S0304-3975(00)00029-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
it is shown that if a is an integer which can be expressed as 2(k) or 2(k) + 1 for some integer 0 less than or equal to k less than or equal to n/2 - 2, then there exist nondeterministic finite automata with n states whose equivalent deterministic finite automata need exactly 2(n)-alpha states. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:485 / 494
页数:10
相关论文
共 8 条