Reachability problems in low-dimensional iterative maps

被引:9
|
作者
Kurganskyy, Oleksiy [1 ]
Potapov, Igor [2 ]
Sancho-Caparrini, Fernando [3 ]
机构
[1] Natl Acad Sci Ukraine, Inst Appl Math & Mech, Donetsk, Ukraine
[2] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, Merseyside, England
[3] Univ Seville, Dept Comp Sci & Artificial Intelligence, E-41012 Seville, Spain
关键词
theory of computing; reachability problems; iterative piecewise maps; pseudo-billiard systems; universality;
D O I
10.1142/S0129054108006054
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we analyze the dynamics of one-dimensional piecewise maps. We show that one-dimensional piecewise affine maps are equivalent to pseudo-billiard or so called "strange billiard" systems. We also show that use of more general classes of functions lead to undecidability of reachability problem for one-dimensional piecewise maps.
引用
收藏
页码:935 / 951
页数:17
相关论文
共 50 条