CAV
2006
Springer
14 years 2 months ago
2006
Springer
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
ICTAC
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. In this paper, I present the class of linear context free languages (LCFLs) with a class of non-deterministic one-way two-head (read only) automata, called non-determinis...