<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06101654</id>
  <dt>a</dt>
  <an>06101654</an>
  <augroup>
    <au>Jir\'askov\'a, Galina</au>
    <au>Shallit, Jeffrey</au>
  </augroup>
  <ti>The state complexity of star-complement-star.</ti>
  <so>Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 380-391 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-31653-1_34</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language $L$ to $\left( \, \overline{L^*} \, \right)^*$.</ab>
    <rv></rv>
  </abgroup>
</item>