<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445869585</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145507.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00236-010-0130-7</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00236-010-0130-7</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Victor Mitrana, Cristina Tîrnăucă]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this note, we show that the number of equivalence queries asked by an algorithm proposed in Becerra-Bonache etal. (Proceedings of the 8th International Colloquium on Grammatical Inference (ICGI '06), Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin 2006) that learns deterministic finite automata with correction and equivalence queries is at most the injectivity degree of the target language, a notion that corresponds to the number of repetitions among the correcting words of all the elements in the quotient of that language by the Myhill-Nerode equivalence. Further, we propose a tight upper bound for the number of correction queries as a function which depends on the index of the target language, the length of the longest counterexample returned by the teacher and the injectivity degree of the target language. However, the bounds obtained here for the number of CQs are optimal for the LCA algorithm, and they do not represent a tight upper bound for DFA learning with EQs and CQs in general.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2010</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Mitrana</subfield>
   <subfield code="D">Victor</subfield>
   <subfield code="u">Depto. Organización y Estructura de la Información, Universidad Politécnica de Madrid, Crta. de Valencia km. 7, 28031, Madrid, Spain</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Tîrnăucă</subfield>
   <subfield code="D">Cristina</subfield>
   <subfield code="u">Departamento de Matemáticas, Estadística y Computación, Universidad de Cantabria, Av. de los Castros s/n, 39005, Santander, Spain</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Acta Informatica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">48/1(2011-02-01), 43-50</subfield>
   <subfield code="x">0001-5903</subfield>
   <subfield code="q">48:1&lt;43</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">48</subfield>
   <subfield code="o">236</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00236-010-0130-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00236-010-0130-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Mitrana</subfield>
   <subfield code="D">Victor</subfield>
   <subfield code="u">Depto. Organización y Estructura de la Información, Universidad Politécnica de Madrid, Crta. de Valencia km. 7, 28031, Madrid, Spain</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Tîrnăucă</subfield>
   <subfield code="D">Cristina</subfield>
   <subfield code="u">Departamento de Matemáticas, Estadística y Computación, Universidad de Cantabria, Av. de los Castros s/n, 39005, Santander, Spain</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Acta Informatica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">48/1(2011-02-01), 43-50</subfield>
   <subfield code="x">0001-5903</subfield>
   <subfield code="q">48:1&lt;43</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">48</subfield>
   <subfield code="o">236</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
