<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malheiro, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Finite derivation type for semilattices of semigroups.</style></title><secondary-title><style face="normal" font="default" size="100%">Semigroup Forum</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s00233-012-9390-6</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><publisher><style face="normal" font="default" size="100%">Springer US, New York, NY</style></publisher><volume><style face="normal" font="default" size="100%">84</style></volume><pages><style face="normal" font="default" size="100%">515–526</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 paper we investigate how the combinatorial property finite derivation type (FDT) is preserved in a semilattice of semigroups. We prove that if S=S[Y,S_α] is a semilattice of semigroups such that Y is finite and each S_α (α∈Y) has FDT, then S has FDT. As a consequence we can show that a strong semilattice of semigroups S[Y,S_α,λ_{α,β}] has FDT if and only if Y is finite and every semigroup S α (α∈Y) has FDT.&lt;/p&gt;
</style></abstract><notes><style face="normal" font="default" size="100%">&lt;p&gt;n/a&lt;/p&gt;
</style></notes></record></records></xml>