%0 Conference Paper %B Lecture Notes in Computer Science %D 2007 %T Study of limits of solvability in tag systems %A De Mol, Liesbeth %E Durand Lose, J %E Margenstern, M %X

In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. This result will be situated in a more general context of research on limits of solvability in tag systems.

%B Lecture Notes in Computer Science %I Springer %@ 978-3-540-74592-1 %G eng