<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz - link info</title>
<link>http://www.netvouz.com/url/5632a63211907170d3c22b334b34f465?feed=rss</link>
<description>Info about a link</description>
<item><title>FSAs and DAWGs</title>
<link>http://www.eti.pg.gda.pl/katedry/kiw/pracownicy/Jan.Daciuk/personal/fsm_algorithms/</link>
<description>Finite-state automata (FSA) and directed acyclic word graphs (DAWG), and some info on transducers</description>
<category domain="http://www.netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Thu, 01 Feb 2007 23:03:26 GMT</pubDate>
</item><item><title>Finite-state automata and directed acyclic graphs</title>
<link>http://www.eti.pg.gda.pl/katedry/kiw/pracownicy/Jan.Daciuk/personal/fsm_algorithms/</link>
<description></description>
<category domain="http://www.netvouz.com/airpocket?category=5585381567499475964"></category>
<author>airpocket</author>
<pubDate>Wed, 01 Mar 2006 04:34:16 GMT</pubDate>
</item></channel></rss>