本文研究了具有周期揉序列KS的双峰映射生成的形式语言£(KS),得到了接受语言£(KS)的最小有限自动机,结出了计算£(KS)的正规语言复杂性的公式.%We study the grammatical complexity of the languages £(KS) generated from bimodal maps with periodic kneading sequences (abbreviated as KS). The minimal DFA accepting £(KS ) is obtained. A formula is given to calculate the regular language complexity of £(KS).
展开▼