Article contents
About the decision of reachability for register machines
Published online by Cambridge University Press: 15 February 2003
Abstract
We study the decidability of the following problem: given p affine functions ƒ1,...,ƒp over $\mathbb{N}^k$ and two vectors $v_1, v_2\in\mathbb{N}^k$, is v2 reachable from v1 by successive iterations of ƒ1,...,ƒp (in this given order)? We show that this question is decidable for p = 1, 2 and undecidable for some fixed p.
Keywords
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 36 , Issue 4 , October 2002 , pp. 341 - 358
- Copyright
- © EDP Sciences, 2002
References
- 7
- Cited by