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 ...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.展开更多
In [7,8] the grammatical complexity of the Feigenbaum attractor and the general Feigenbaum attractors,generated by period-n-tupling,are studied. In this paper we study the grammatical complexity of the Feigenbaum type...In [7,8] the grammatical complexity of the Feigenbaum attractor and the general Feigenbaum attractors,generated by period-n-tupling,are studied. In this paper we study the grammatical complexity of the Feigenbaum type attractors ,including Felgenbaum attractors and general Fdgenbaum attractors,in periodic windows. It is shown that the languages determined by these attractors are CLS and are not CFL.展开更多
基金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.
文摘In [7,8] the grammatical complexity of the Feigenbaum attractor and the general Feigenbaum attractors,generated by period-n-tupling,are studied. In this paper we study the grammatical complexity of the Feigenbaum type attractors ,including Felgenbaum attractors and general Fdgenbaum attractors,in periodic windows. It is shown that the languages determined by these attractors are CLS and are not CFL.