Complexity of unimodal maps with aperiodic kneading sequences
Wang, Y; Yang, L; Xie, HM; Xie, HM , Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China.
刊名NONLINEARITY
1999
卷号12期号:4页码:1151-1176
关键词Grammatical Complexity Dynamical-systems Computation
ISSN号0951-7715
英文摘要It is well established that a format language generated from a unimodal map is regular if and only if the map's kneading sequence is either periodic or eventually periodic. A previously proposed conjecture said that if a language generated from a unimodal map is context-free, then it must be regular, i.e. there exists no proper context-free language which can be generated from a unimodal map. This paper is a step forward in answering this conjecture showing that under two situations the conjecture is true. The main results of this paper are: (1) if the kneading map of a unimodal map is unbounded, then the map's language is not context-free, (2) all nonregular languages generated from the Fibonacci substitutions are context-sensitive, but not context-free. These results strongly suggest that the conjecture may he indeed true.
学科主题Physics
URL标识查看原文
WOS记录号WOS:000081621900023
公开日期2012-08-29
内容类型期刊论文
源URL[http://ir.itp.ac.cn/handle/311006/13122]  
专题理论物理研究所_理论物理所1978-2010年知识产出
通讯作者Xie, HM , Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China.
推荐引用方式
GB/T 7714
Wang, Y,Yang, L,Xie, HM,et al. Complexity of unimodal maps with aperiodic kneading sequences[J]. NONLINEARITY,1999,12(4):1151-1176.
APA Wang, Y,Yang, L,Xie, HM,&Xie, HM , Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China..(1999).Complexity of unimodal maps with aperiodic kneading sequences.NONLINEARITY,12(4),1151-1176.
MLA Wang, Y,et al."Complexity of unimodal maps with aperiodic kneading sequences".NONLINEARITY 12.4(1999):1151-1176.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace