<bibliography>
 <citation type="inproceedings" key="HKK">
  <author>K. Halunen</author>
  <author>J. Kortelainen</author>
  <author>Kortelainen T.</author>
  <year>2009</year>
  <title>Multicollision Attacks on Generalized Iterated Hash Functions</title>
  <booktitle>Eight Australasian Information Security Conference (AISC2010)</booktitle>
  <series>Australian Computer Science Communications</series>
  <volume>32</volume>
  <pages>85&#8211;93</pages>
 </citation>
 <citation type="book" key="Har">
  <author>Michael A. Harrison</author>
  <year>1978</year>
  <title>Introduction to formal language theory</title>
  <publisher>Addison-Wesley Publishing Co., Reading, Mass.</publisher>
 </citation>
 <citation type="incollection" key="HoS">
  <author>Jonathan Hoch</author>
  <author>Adi Shamir</author>
  <year>2006</year>
  <title>Breaking the ICE -– Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions</title>
  <editor>Matthew Robshaw</editor>
  <booktitle>Fast Software Encryption</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>4047</volume>
  <publisher>Springer Berlin / Heidelberg</publisher>
  <pages>179&#8211;194</pages>
  <doi>10.1007/11799313_12</doi>
 </citation>
 <citation type="incollection" key="Jou">
  <author>Antoine Joux</author>
  <year>2004</year>
  <title>Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions</title>
  <editor>Matt Franklin</editor>
  <booktitle>Advances in Cryptology &#8211; CRYPTO 2004</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>3152</volume>
  <publisher>Springer Berlin / Heidelberg</publisher>
  <pages>99&#8211;213</pages>
  <doi>10.1007/978-3-540-28628-8_19</doi>
 </citation>
 <citation type="unpublished" key="KKV">
  <author>J. Kortelainen</author>
  <author>T. Kortelainen</author>
  <author>A. Vesanen</author>
  <year>2011</year>
  <title>Unavoidable regularities in long words with bounded number of symbol occurrences</title>
  <note>Accepted to The 17th Annual International Computing and Combinatorics Conference (COCOON 2011)</note>
 </citation>
 <citation type="article" key="KHK">
  <author>Juha Kortelainen</author>
  <author>Kimmo Halunen</author>
  <author>Tuomas Kortelainen</author>
  <year>2010</year>
  <title>Multicollision attacks and generalized iterated hash functions</title>
  <journal>J. Math. Cryptol.</journal>
  <volume>4</volume>
  <number>3</number>
  <pages>239&#8211;270</pages>
  <doi>10.1515/JMC.2010.010</doi>
 </citation>
 <citation type="incollection" key="KKH">
  <author>T. Kortelainen</author>
  <author>J. Kortelainen</author>
  <author>J. Halunen</author>
  <year>2010</year>
  <title>Variants of multicollision attacks on iterated hash functions</title>
  <booktitle>6th China International Conference on Information Security and Cryptology (Inscrypt 2010)</booktitle>
  <pages>159&#8211;175</pages>
 </citation>
 <citation type="book" key="Lot">
  <author>M. Lothaire</author>
  <year>1997</year>
  <title>Combinatorics on words</title>
  <series>Cambridge Mathematical Library</series>
  <publisher>Cambridge University Press</publisher>
  <address>Cambridge</address>
  <doi>10.1017/CBO9780511566097</doi>
 </citation>
 <citation type="book" key="dLV">
  <author>Aldo de Luca</author>
  <author>Stefano Varricchio</author>
  <year>1999</year>
  <title>Finiteness and regularity in semigroups and formal languages</title>
  <series>Monographs in Theoretical Computer Science. An EATCS Series</series>
  <publisher>Springer-Verlag</publisher>
  <address>Berlin</address>
 </citation>
 <citation type="article" key="NaS">
  <author>Mridul Nandi</author>
  <author>Douglas R. Stinson</author>
  <year>2007</year>
  <title>Multicollision attacks on some generalized sequential hash functions</title>
  <journal>IEEE Trans. Inform. Theory</journal>
  <volume>53</volume>
  <number>2</number>
  <pages>759&#8211;767</pages>
  <doi>10.1109/TIT.2006.889721</doi>
 </citation>
 <citation type="article" key="Res">
  <author>A. Restivo</author>
  <year>1977</year>
  <title>Mots sans r&#233;p&#233;titions et langages rationnels born&#233;s</title>
  <journal>RAIRO Informat. Th&#233;or.</journal>
  <volume>11</volume>
  <number>3</number>
  <pages>197&#8211;202, iv</pages>
 </citation>
 <citation type="article" key="RR1">
  <author>Antonio Restivo</author>
  <author>Christophe Reutenauer</author>
  <year>1983</year>
  <title>Some applications of a theorem of Shirshov to language theory</title>
  <journal>Inform. and Control</journal>
  <volume>57</volume>
  <number>2-3</number>
  <pages>205&#8211;213</pages>
  <doi>10.1016/S0019-9958(83)80044-8</doi>
 </citation>
 <citation type="article" key="RR2">
  <author>Antonio Restivo</author>
  <author>Christophe Reutenauer</author>
  <year>1985</year>
  <title>Rational languages and the Burnside problem</title>
  <journal>Theoret. Comput. Sci.</journal>
  <volume>40</volume>
  <number>1</number>
  <pages>13&#8211;30</pages>
  <doi>10.1016/0304-3975(85)90156-2</doi>
 </citation>
 <citation type="incollection" key="STKT">
  <author>Kazuhiro Suzuki</author>
  <author>Dongvu Tonien</author>
  <author>Kaoru Kurosawa</author>
  <author>Koji Toyota</author>
  <year>2006</year>
  <title>Birthday paradox for multi-collisions</title>
  <booktitle>Information security and cryptology&#8212;ICISC 2006</booktitle>
  <series>Lecture Notes in Comput. Sci.</series>
  <volume>4296</volume>
  <publisher>Springer</publisher>
  <address>Berlin</address>
  <pages>29&#8211;40</pages>
  <doi>10.1007/11927587_5</doi>
 </citation>
</bibliography>
