首页 | 本学科首页   官方微博 | 高级检索  
     检索      


THE FINITE AUTOMATA OF EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL
Authors:Xie Huimin
Institution:Xie Huimin Department of Mathematics
Abstract: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.
Keywords:Dynamical system  Unimodal map  Kneading sequence
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号