<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandra Silva</style></author><author><style face="normal" font="default" size="100%">Bram Westerbaan</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A coalgebraic view of e- transitions</style></title><secondary-title><style face="normal" font="default" size="100%">CALCO - 5th Conference on Algebra and Coalgebra in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">September</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/xana/files/main.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Warsaw, Poland</style></pub-location><volume><style face="normal" font="default" size="100%">8089</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In automata theory, a machine transitions from one state to the next when it reads an input symbol. It is common to also allow an automaton to transition without input, via an ε-transition. These ε-transitions are convenient, e.g., when one defines the composition of automata. However, they are not necessary, and can be eliminated. Such ε-elimination procedures have been studied separately for different types of automata, including non-deterministic and weighted automata.&lt;br /&gt;
It has been noted by Hasuo that it is possible to give a coalgebraic account of ε-elimination for some automata using trace semantics (as defined by Hasuo, Jacobs and Sokolova).&lt;br /&gt;
In this paper, we give a detailed description of the ε-elimination procedure via trace semantics (missing in the literature). We apply this framework to several types of automata, and explore its boundary.&lt;br /&gt;
In particular, we show that is possible (by careful choice of a monad) to define an ε-removal procedure for all weighted automata over the positive reals (and certain other semirings). Our definition extends the recent proposals by Sakarovitch and Lombardy for these semirings.&lt;/p&gt;
</style></abstract></record></records></xml>