双峰映射和Lorenz映射的复杂性研究

THE STUDY OF COMPLEXITY OF BIMODAL MAPS AND LORENZ MAPS

本文以形式语言和自动机理论为工具，研究一般的双峰映射和Ｌｏｒｅｎｚ映射生成的语言的复杂性，证明了语言为正规的充要条件是映射的揉序列均为终结周期．

Using the theory of formal languges and automata, we study the complexity of the lan- guages generated by bimodal maps and Lorenz maps, we prove that the necessary and sufficient condition for the languages being regular is: the kneading sequences of the maps are eventually periodic.