<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Khoussainov, Bakhadyr</style></author><author><style face="normal" font="default" size="100%">Liu, Jiamou</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computable categoricity of graphs with finite components</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and theory of algorithms</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Comput. Sci.</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-540-69407-6_15</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer, Berlin</style></publisher><volume><style face="normal" font="default" size="100%">5028</style></volume><pages><style face="normal" font="default" size="100%">139–148</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>