共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
The number of states in a deterministic finite automaton (DFA) recognizing the language , where is regular language recognized by an -state DFA, and is a constant, is shown to be at most and at least in the worst case, for every and for every alphabet of at least six letters. Thus, the state complexity of is . In the case the corresponding state complexity function for is determined as with the lower bound witnessed by automata over a four-letter alphabet. The nondeterministic state complexity of is demonstrated to be . This bound is shown to be tight over a two-letter alphabet. 相似文献
11.
12.
13.
14.
15.
16.
17.
18.
19.