<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:rss="http://purl.org/rss/1.0/">
<channel rdf:about="http://www.edpsciences.org/articles/ita/rss/TOCRSS/rss.xml">
<title>Recent articles published in 'RAIRO - Theoretical Informatics and Applications'</title>
<link>http://www.rairo-ita.org</link>
<description>Recent articles published in 'RAIRO - Theoretical Informatics and Applications'</description>
<items>
<rdf:Seq>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010008"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010010"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010006"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010012"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010004"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010005"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010007"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010003"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010009"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010001"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010002"/>
<rdf:li resource="http://www.rairo-ita.org/10.1051/ita/2010011"/>
</rdf:Seq>
</items>
<sy:updatePeriod>daily</sy:updatePeriod>
<sy:updateFrequency>1</sy:updateFrequency>
<sy:updateBase>2010-3-11T:19:11:30Z
</sy:updateBase>
<dc:publisher>EDP Sciences</dc:publisher>
<dc:rights>Copyright (c) EDP Sciences 2010</dc:rights>
<prism:copyright>Copyright (c) EDP Sciences 2010</prism:copyright>
<prism:issn>0988-3754</prism:issn>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
</channel>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010008">
<rss:title>On the number of squares in partial words</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010008</rss:link>
<rss:description>Authors: Vesa Halava, Tero Harju and Tomi Kärki.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 125&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Square ; partial word ; theorem of Fraenkel and Simpson..68R15..</rss:description>
<dc:title>On the number of squares in partial words</dc:title>
<dc:creator>Vesa Halava</dc:creator>
<dc:creator>Tero Harju</dc:creator>
<dc:creator>Tomi Kärki</dc:creator>
<dc:subject>Square</dc:subject>
<dc:subject>partial word</dc:subject>
<dc:subject>theorem of Fraenkel and Simpson.</dc:subject>
<dc:subject>68R15.</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010008</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>125</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010010">
<rss:title>Binary words avoiding the pattern AABBCABBA</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010010</rss:link>
<rss:description>Authors: Pascal Ochem.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 151&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Combinatorics on words ; letter frequency ; factor complexity.68R15.</rss:description>
<dc:title>Binary words avoiding the pattern AABBCABBA</dc:title>
<dc:creator>Pascal Ochem</dc:creator>
<dc:subject>Combinatorics on words</dc:subject>
<dc:subject>letter frequency</dc:subject>
<dc:subject>factor complexity</dc:subject>
<dc:subject>68R15</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010010</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>151</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010006">
<rss:title>Formal language properties of hybrid systems with strong resets</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010006</rss:link>
<rss:description>Authors: Thomas Brihaye, Véronique Bruyère and Elaine Render.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 79&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Hybrid systems with strong resets ; formal language
theory..68Q68 ; 68Q45.</rss:description>
<dc:title>Formal language properties of hybrid systems with strong resets</dc:title>
<dc:creator>Thomas Brihaye</dc:creator>
<dc:creator>Véronique Bruyère</dc:creator>
<dc:creator>Elaine Render</dc:creator>
<dc:subject>Hybrid systems with strong resets</dc:subject>
<dc:subject>formal language
theory.</dc:subject>
<dc:subject>68Q68</dc:subject>
<dc:subject>68Q45</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010006</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>79</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010012">
<rss:title>On the growth rates of complexity of threshold languages</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010012</rss:link>
<rss:description>Authors: Arseny M. Shur and Irina A. Gorbunova.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 175&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Power-free languages ; Dejean's conjecture ; threshold languages ; combinatorial complexity ; growth rate..68Q70 ; 68R15.</rss:description>
<dc:title>On the growth rates of complexity of threshold languages</dc:title>
<dc:creator>Arseny M. Shur</dc:creator>
<dc:creator>Irina A. Gorbunova</dc:creator>
<dc:subject>Power-free languages</dc:subject>
<dc:subject>Dejean's conjecture</dc:subject>
<dc:subject>threshold languages</dc:subject>
<dc:subject>combinatorial complexity</dc:subject>
<dc:subject>growth rate.</dc:subject>
<dc:subject>68Q70</dc:subject>
<dc:subject>68R15</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010012</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>175</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010004">
<rss:title>On the computation of covert channel capacity</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010004</rss:link>
<rss:description>Authors: Eugene Asarin and Cătălin Dima.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 37&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Covert channels ; entropy ; synchronous transducers..94A17 ; 94A24 ; 68Q68..</rss:description>
<dc:title>On the computation of covert channel capacity</dc:title>
<dc:creator>Eugene Asarin</dc:creator>
<dc:creator>Cătălin Dima</dc:creator>
<dc:subject>Covert channels</dc:subject>
<dc:subject>entropy</dc:subject>
<dc:subject>synchronous transducers.</dc:subject>
<dc:subject>94A17</dc:subject>
<dc:subject>94A24</dc:subject>
<dc:subject>68Q68.</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010004</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>37</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010005">
<rss:title>How to build billiard words using decimations</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010005</rss:link>
<rss:description>Authors: Jean-Pierre Borel.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 59&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Decimations..68R15 ; 68Q68.</rss:description>
<dc:title>How to build billiard words using decimations</dc:title>
<dc:creator>Jean-Pierre Borel</dc:creator>
<dc:subject>Decimations.</dc:subject>
<dc:subject>68R15</dc:subject>
<dc:subject>68Q68</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010005</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>59</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010007">
<rss:title>Infinite words containing squares at every position</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010007</rss:link>
<rss:description>Authors: James Currie and Narad Rampersad.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 113&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Infinite words ; power-free words ; squares..68R15..</rss:description>
<dc:title>Infinite words containing squares at every position</dc:title>
<dc:creator>James Currie</dc:creator>
<dc:creator>Narad Rampersad</dc:creator>
<dc:subject>Infinite words</dc:subject>
<dc:subject>power-free words</dc:subject>
<dc:subject>squares.</dc:subject>
<dc:subject>68R15.</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010007</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>113</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010003">
<rss:title>Radix enumeration of rational languages</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010003</rss:link>
<rss:description>Authors: Pierre-Yves Angrand and Jacques Sakarovitch.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 19&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Finite automata ; rational functions of words ; sequential transducers..68Q45 ; 68Q70..</rss:description>
<dc:title>Radix enumeration of rational languages</dc:title>
<dc:creator>Pierre-Yves Angrand</dc:creator>
<dc:creator>Jacques Sakarovitch</dc:creator>
<dc:subject>Finite automata</dc:subject>
<dc:subject>rational functions of words</dc:subject>
<dc:subject>sequential transducers.</dc:subject>
<dc:subject>68Q45</dc:subject>
<dc:subject>68Q70.</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010003</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>19</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010009">
<rss:title>The critical exponent of the Arshon words</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010009</rss:link>
<rss:description>Authors: Dalia Krieger.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 139&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Arshon words ; critical exponent..68R15..</rss:description>
<dc:title>The critical exponent of the Arshon words</dc:title>
<dc:creator>Dalia Krieger</dc:creator>
<dc:subject>Arshon words</dc:subject>
<dc:subject>critical exponent.</dc:subject>
<dc:subject>68R15.</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010009</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>139</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010001">
<rss:title>Foreword</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010001</rss:link>
<rss:description>Authors: V. Bruyère and M. Rigo.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 1&lt;br /&gt;Published online: 11/2/2010</rss:description>
<dc:title>Foreword</dc:title>
<dc:creator>V. Bruyère</dc:creator>
<dc:creator>M. Rigo</dc:creator>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010001</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>1</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010002">
<rss:title>Morphisms fixing words associated with exchange of three intervals</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010002</rss:link>
<rss:description>Authors: Petr Ambrož, Zuzana Masáková and Edita Pelantová.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 3&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Interval exchange transformation ; Sturmian morphisms ; substitution invariance..68R15 ; 08A50.</rss:description>
<dc:title>Morphisms fixing words associated with exchange of three intervals</dc:title>
<dc:creator>Petr Ambrož</dc:creator>
<dc:creator>Zuzana Masáková</dc:creator>
<dc:creator>Edita Pelantová</dc:creator>
<dc:subject>Interval exchange transformation</dc:subject>
<dc:subject>Sturmian morphisms</dc:subject>
<dc:subject>substitution invariance.</dc:subject>
<dc:subject>68R15</dc:subject>
<dc:subject>08A50</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010002</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>3</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
<rss:item rdf:about="http://www.rairo-ita.org/10.1051/ita/2010011">
<rss:title>Standard factors of Sturmian words</rss:title>
<rss:link>http://www.rairo-ita.org/10.1051/ita/2010011</rss:link>
<rss:description>Authors: Gwénaël Richomme, Kalle Saari and Luca Q. Zamboni.&lt;br /&gt;RAIRO - Theoretical Informatics and Applications Vol. 44 , page 159&lt;br /&gt;Published online: 11/2/2010&lt;br /&gt;
       Keywords: 
       Sturmian words ; standard factors ; morphisms ; palindromes.68R15.</rss:description>
<dc:title>Standard factors of Sturmian words</dc:title>
<dc:creator>Gwénaël Richomme</dc:creator>
<dc:creator>Kalle Saari</dc:creator>
<dc:creator>Luca Q. Zamboni</dc:creator>
<dc:subject>Sturmian words</dc:subject>
<dc:subject>standard factors</dc:subject>
<dc:subject>morphisms</dc:subject>
<dc:subject>palindromes</dc:subject>
<dc:subject>68R15</dc:subject>
<dc.date>2010-2-11</dc.date>
<dc:format>text/html</dc:format>
<dc:identifier>10.1051/ita/2010011</dc:identifier>
<dc:source>RAIRO - Theoretical Informatics and Applications  Vol. 44(1)</dc:source>
<prism:category>abstract</prism:category>
<prism:issueIdentifier>ita/2010/01</prism:issueIdentifier>
<prism:publicationDate>2010-2-11</prism:publicationDate>
<prism:publicationName>RAIRO - Theoretical Informatics and Applications</prism:publicationName>
<prism:startingPage>159</prism:startingPage>
<prism:volume>44</prism:volume>
</rss:item>
</rdf:RDF>
