Every dense regularlanguage contains an imprimitive word.
每一种密集正规语言中都含有非本原字。
2
S. in 1998: every dense regularlanguage contains an imprimitive word.
在1998年提出的另一个猜想：稠密正规语言中含非本原字；
3
The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved, and then, the recursiveness of regularlanguage was analyzed.