<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Mol, Liesbeth</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Solvability of the halting and reachability problem for binary 2-tag systems</style></title><secondary-title><style face="normal" font="default" size="100%">Fundamenta Informaticae</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">99</style></volume><pages><style face="normal" font="default" size="100%">435–471</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this report we will provide a detailed proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a shiftnumber &lt;em&gt;v&lt;/em&gt; = 2.&lt;/p&gt;</style></abstract></record></records></xml>