<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marcello Bonsangue</style></author><author><style face="normal" font="default" size="100%">Jan Rutten</style></author><author><style face="normal" font="default" size="100%">Alexandra Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Regular expressions for polynomial coalgebras</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/xana/files/11926d.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">SEN-0703</style></number><publisher><style face="normal" font="default" size="100%">Centrum Wiskunde &amp; Informatica (CWI)</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, The Netherlands</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;For polynomial set functors G, we introduce a language of expressions for describing elements of final G-coalgebra. We show that every state of a finite G-coalgebra corresponds to an expression in the language, in the sense that they both have the same semantics. Conversely, we give a compositional synthesis algorithm which transforms every expression into a finite G-coalgebra. The language of expressions is equipped with an equational system that is sound, complete and expressive with respect to G-bisimulation.&lt;/p&gt;
</style></abstract></record></records></xml>