<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
<channel>
<title>1</title>
<link>http://hdl.handle.net/10338.dmlcz/127219</link>
<description>1</description>
<image>
<title>The Channel Image</title>
<url xmlns="http://apache.org/cocoon/i18n/2.1">http://localhost:8080/retrieve/2248562</url>
<link>http://hdl.handle.net/10338.dmlcz/127219</link>
</image>
<item>
<title>A graph method for Markov models solving</title>
<link>http://hdl.handle.net/10338.dmlcz/120476</link>
<description>A graph method for Markov models solving</description>
<pubDate>Fri, 30 Jan 2009 09:01:01 GMT</pubDate>
</item>
<item>
<title>Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata</title>
<link>http://hdl.handle.net/10338.dmlcz/120475</link>
<description>Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata</description>
<pubDate>Fri, 30 Jan 2009 09:00:57 GMT</pubDate>
</item>
<item>
<title>Maximal reflectivity preserving subextensions</title>
<link>http://hdl.handle.net/10338.dmlcz/120474</link>
<description>Maximal reflectivity preserving subextensions</description>
<pubDate>Fri, 30 Jan 2009 09:00:53 GMT</pubDate>
</item>
<item>
<title>Division space axiomatics</title>
<link>http://hdl.handle.net/10338.dmlcz/120473</link>
<description>Division space axiomatics</description>
<pubDate>Fri, 30 Jan 2009 09:00:49 GMT</pubDate>
</item>
</channel>
</rss>
