State complexity: Recent results and open problems

被引:0
|
作者
Yu, S [1 ]
机构
[1] Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada
关键词
state complexity; regular languages; finite languages; finite automata;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we summarize recent results and progress in state complexity research. We analyze why many basic state complexity problems were not solved earlier, ill the sixties and seventies. We also suggest several future directions for this area of research.
引用
收藏
页码:471 / 480
页数:10
相关论文
共 50 条