Voir la notice de l'article provenant de la source Numdam
We study the decidability of the following problem: given affine functions over and two vectors , is reachable from by successive iterations of (in this given order)? We show that this question is decidable for and undecidable for some fixed .
@article{ITA_2002__36_4_341_0, author = {Cortier, V\'eronique}, title = {About the decision of reachability for register machines}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {341--358}, publisher = {EDP-Sciences}, volume = {36}, number = {4}, year = {2002}, doi = {10.1051/ita:2003001}, mrnumber = {1965421}, zbl = {1034.68057}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2003001/} }
TY - JOUR AU - Cortier, Véronique TI - About the decision of reachability for register machines JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2002 SP - 341 EP - 358 VL - 36 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita:2003001/ DO - 10.1051/ita:2003001 LA - en ID - ITA_2002__36_4_341_0 ER -
%0 Journal Article %A Cortier, Véronique %T About the decision of reachability for register machines %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2002 %P 341-358 %V 36 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita:2003001/ %R 10.1051/ita:2003001 %G en %F ITA_2002__36_4_341_0
Cortier, Véronique. About the decision of reachability for register machines. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 36 (2002) no. 4, pp. 341-358. doi: 10.1051/ita:2003001
Cité par Sources :