<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><title>An IslandScholar Citation Feed</title><link>http://vre2.upei.ca:8080/solr</link><description>
          A scholar's citation feed.
         </description><language>en-us</language><docs>http://vre2.upei.ca:8080/solr</docs><item><title>Mergible states in large NFA</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1534</link><description>Campeanu, Cezar; Santean, Nicolae; Yu, Sheng; "Mergible states in large NFA", Theoretical Computer Science, 2005, 1, 23</description><pubDate>2012-10-19T12:03:37.483Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1534</guid></item><item><title>Tight bounds for NFA to DFCA transformations for binary alphabets</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1538</link><description>Campeanu, Cezar; Paun, Andrei; "Tight bounds for NFA to DFCA transformations for binary alphabets", Implementation and application of automata, 2005, , 306</description><pubDate>2012-10-19T12:11:36.479Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1538</guid></item><item><title>Computing beyond the Turing limit using the H systems</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1524</link><description>Campeanu, Cezar; Puaun, Andrei; "Computing beyond the Turing limit using the H systems", DNA computing, 2005, , 24</description><pubDate>2012-10-19T12:48:01.7Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1524</guid></item><item><title>Incremental construction of minimal deterministic finite cover automata</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1525</link><description>Campeanu, Cezar; Paun, Andrei; Smith, Jason R.; "Incremental construction of minimal deterministic finite cover automata", Theoretical Computer Science, 2006, 2, 135</description><pubDate>2012-10-19T13:13:24.332Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1525</guid></item><item><title>Regex and extended regex</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1540</link><description>Campeanu, Cezar; Salomaa, K.; Yu, S.; "Regex and extended regex", Implementation and application of automata, 2003, , 77</description><pubDate>2012-10-19T13:20:22.592Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1540</guid></item><item><title>Results on transforming NFA into DFCA</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1537</link><description>Campeanu, Cezar; Kari, L.; Paun, Andrei; "Results on transforming NFA into DFCA", Fundamenta Informaticae, 2005, 1-4, 53</description><pubDate>2012-10-19T13:27:45.397Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1537</guid></item><item><title>Counting the number of minimal DFCA obtained by merging states</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1523</link><description>Campeanu, Cezar; Paun, Andrei; "Counting the number of minimal DFCA obtained by merging states", International Journal of Foundations of Computer Science, 2003, 6, 995</description><pubDate>2012-10-19T13:32:24.558Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1523</guid></item><item><title>Automata recognizing no words: a statistical approach</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1527</link><description>Calude, Cristian S.; Campeanu, Cezar; Dumitrescu, Monica; "Automata recognizing no words: a statistical approach", Fundamenta Informaticae, 2006, 1-2, 1</description><pubDate>2012-10-19T13:57:39.662Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1527</guid></item><item><title>Shuffle decompositions of regular languages</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1530</link><description>Campeanu, Cezar; Salomaa, K.; Vagvolgyi, S.; "Shuffle decompositions of regular languages", International Journal of Foundations of Computer Science, 2002, 6, 799</description><pubDate>2012-10-19T14:02:37.373Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1530</guid></item><item><title>An incremental algorithm for constructing minimal deterministic finite cover automata</title><link>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1536</link><description>Campeanu, Cezar; Paun, Andrei; Smith, J. R.; "An incremental algorithm for constructing minimal deterministic finite cover automata", Implementation and application of automata, 2006, , 90</description><pubDate>2012-10-19T14:06:17.902Z</pubDate><guid>
        http://islandscholar.ca/fedora/repository/ir:ir-batch6-1536</guid></item></channel></rss>