Mortality of iterated piecewise affine functions over the integers: decidability and complexity

DOI10.3233/COM-150032MaRDI QIDQ5261153zbMATHOpenAlexFDO

Authors Amir M. Ben-Amram

Publication date 1 July 2015

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-150032

zbMATH Keywords

mortalityconvergenceundecidabilityterminationpiecewise-affine functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
• Deciding stability and mortality of piecewise affine dynamical systems
• Mortality Problem for 2×2 Integer Matrices
• Mortality problem and affine automata
• About the decision of reachability for register machines

Cited in

(6)

• Reachability problems for one-dimensional piecewise affine maps
• Deciding stability and mortality of piecewise affine dynamical systems
• Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
• On Affine Reachability Problems
• Topological formulation of termination properties of iterates of functions
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers

This page was built for publication: Mortality of iterated piecewise affine functions over the integers: decidability and complexity

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