期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
THE FINITE AUTOMATA OF EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL
1
作者 谢惠民 《苏州大学学报(自然科学版)》 CAS 1993年第2期112-118,共7页
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. 展开更多
关键词 有限自动控制 KS 捏合序列 语言控制 计算机语言
下载PDF
GRAMMATICAL COMPLEXITY OF FEIGENBAUM TYPE ATTRACTORS IN PERIODIC WINDOWS
2
作者 陈曦 卢钦和 《苏州大学学报(自然科学版)》 CAS 1995年第2期17-22,共6页
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. 展开更多
关键词 语法复杂度 周期视窗 正式语言 捏合序列 Feigenbaum吸引子 空间地图 动力系统
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部