<?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%">Woods, Damien</style></author><author><style face="normal" font="default" size="100%">Neary, Turlough</style></author><author><style face="normal" font="default" size="100%">Seda, Tony</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On the boundaries of solvability and unsolvability in tag systems. Theoretical and experimental results.</style></title><secondary-title><style face="normal" font="default" size="100%">The complexity of simple programs</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Cork University Press</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Several older and more recent results on the boundaries of solvability and unsolvability in tag systems are surveyed. Emphasis will be put on the significance of computer experiments in research on very small tag systems.&lt;/p&gt;</style></abstract></record></records></xml>