<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Mol, Liesbeth</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Durand Lose, J</style></author><author><style face="normal" font="default" size="100%">Margenstern, M</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Study of limits of solvability in tag systems</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><isbn><style face="normal" font="default" size="100%">978-3-540-74592-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record></records></xml>