Artículo
Reachability problems in low-dimensional iterative maps
Autor/es | Kurganskyy, Oleksiy
Potapov, Igor Sancho Caparrini, Fernando |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2008 |
Fecha de depósito | 2021-04-19 |
Publicado en |
|
Resumen | In this paper we analyse the dynamics of one-dimensional
piecewise maps (PAMs). We show that one-dimensional PAMs are equiv-
alent to pseudo-billiard or so called \strange billiard" systems. We also
show that the more ... In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equiv- alent to pseudo-billiard or so called \strange billiard" systems. We also show that the more general class of rational functions leads to undecid- ability of reachability problem for one-dimensional piecewise maps with a ¯nite number of intervals. |
Cita | Kurganskyy, O., Potapov, I. y Sancho Caparrini, F. (2008). Reachability problems in low-dimensional iterative maps. International Journal of Foundations of Computer Science, 19 (4), 935-951. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Reachability problems in low-d ... | 915.8Kb | [PDF] | Ver/ | |