TY - CONF T1 - Study of limits of solvability in tag systems T2 - Lecture Notes in Computer Science Y1 - 2007 A1 - De Mol, Liesbeth ED - Durand Lose, J ED - Margenstern, M AB -

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.

JA - Lecture Notes in Computer Science PB - Springer SN - 978-3-540-74592-1 ER -