Sciweavers

CAV
2006
Springer
90views Hardware» more  CAV 2006»
14 years 3 months ago
Termination of Integer Linear Programs
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...
Mark Braverman
ICTAC
2007
Springer
14 years 5 months ago
Linear Context Free Languages
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...
Roussanka Loukanova