Computation in One-Dimensional Piecewise Maps

DOI10.1007/978-3-540-71493-4_66MaRDI QIDQ3613017zbMATH OpenOpenAlexFDO

Authors O. Kurganskyy, Igor Potapov, Fernando Sancho Caparrini

Publication date 11 March 2009

Published in Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71493-4_66

Mathematics Subject Classification ID

Dynamical systems involving maps of the interval (37E05) Attainable sets, reachability (93B03)

Recommendations

• REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
• Unconventional Computation
• Reachability problems for one-dimensional piecewise affine maps
• On reachability problem in 1-dimensional 2-interval piecewise-affine mappings
• Reachability problems for PAMs

Cited in

(11)

• On undecidability bounds for matrix decision problems
• Reachability problems for PAMs
• Reachability problems for one-dimensional piecewise affine maps
• Universality of one-dimensional piecewise elementary maps
• REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
• Low dimensional hybrid systems -- decidable, undecidable, don't know
• Computing Complex Horseshoes by Means of Piecewise Maps
• On reachability problem in 1-dimensional 2-interval piecewise-affine mappings
• Unconventional Computation
• Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
• On the decidability of reachability in continuous time linear time-invariant systems

This page was built for publication: Computation in One-Dimensional Piecewise Maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613017)