<?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%">SergeyGoncharov</style></author><author><style face="normal" font="default" size="100%">Stefan Milius</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards a Coalgebraic Chomsky Hierarchy</style></title><secondary-title><style face="normal" font="default" size="100%">IFIP International Conference on Theoretical Computer Science (IFIP TCS)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</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/1401.5277v3.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%">Rome, Italy</style></pub-location><volume><style face="normal" font="default" size="100%">8705</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The Chomsky hierarchy plays a prominent role in the foundations of the theoretical computer science relating classes of formal languages of primary importance. In this paper we use recent developments on coalgebraic and monad-based semantics to obtain a generic notion of a T-automaton, where T is a monad, which allows the uniform study of various notions of machines (e.g. finite state machines, multi-stack machines, Turing machines, valence automata, weighted automata). We use the generalized powerset construction to define a generic (trace) semantics for T-automata, and we show by numerous examples that it correctly instantiates for the known classes of machines/languages captured by the Chomsky hierarchy. Moreover, our approach provides new generic techniques for proving expressivity bounds of various machine-based models.&lt;/p&gt;
</style></abstract></record></records></xml>