THE FINITE AUTOMATA OF EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL  

作　　者：谢惠民 

机构地区：[1]Department of Mathematics

出　　处：《苏州大学学报（自然科学版）》1993年第2期112-118,共7页Journal of Soochow University(Natural Science Edition)

基　　金：National Basic Research Project"Nonlinear Science"

摘　　要：For unimodal maps on the interval we prove that, if the kneading sequences (KS) are eventually periodic, then their formal languages are regular ones. The finite automata for such languages are constructed. Comparing with the languages generated by periodic KS, it is shown that the languages here are not finite complement languages.For unimodal maps on the interval we prove that, if the kneading sequences (KS) are eventually periodic, then their formal languages are regular ones. The finite automata for such languages are constructed. Comparing with the languages generated by periodic KS, it is shown that the languages here are not finite complement languages.

关 键 词：有限自动控制 KS 捏合序列 语言控制 计算机语言 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]