<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">467989842</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323112541.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e19900901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF00264285</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF00264285</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Weber</subfield>
   <subfield code="D">Andreas</subfield>
   <subfield code="u">Fachbereich Informatik, J.W. Goethe-Universität, Postfach 111932, D-6000, Frankfurt am Main 11, Federal Republic of Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">On the valuedness of finite transducers</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Andreas Weber]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Summary: We investigate the valuedness of finite transducers in connection with their inner structure. We show: The valuedness of a finite-valued nondeterministic generalized sequential machine (NGSM) M with n states and output alphabet Δ is at most the maximum of (1-⌊1/#Δ⌋) · (2 k 1 · k 3 ) n · n n ·#Δ n 3 ·k 4 / 3 and ⌊1/#Δ⌋·(2 k 2 ·k 3 ·(1+k 4 )) n ·n n where k 1≦6.25 and k 2≦11.89 are constants and k 3≧1 and k 4≧0 are local structural parameters of M. There are two simple criteria which characterize the infinite valuedness of an NGSM. By these criteria, it is decidable in polynomial time whether or not an NGSM is infinite-valued. In both cases, #Δ &gt; 1 and #Δ = 1, the above upper bound for the valuedness is almost optimal. By reduction, all results can be easily generalized to normalized finite transducers.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 1990</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Acta Informatica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">27/8(1990-09-01), 749-780</subfield>
   <subfield code="x">0001-5903</subfield>
   <subfield code="q">27:8&lt;749</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">27</subfield>
   <subfield code="o">236</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF00264285</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/BF00264285</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">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Weber</subfield>
   <subfield code="D">Andreas</subfield>
   <subfield code="u">Fachbereich Informatik, J.W. Goethe-Universität, Postfach 111932, D-6000, Frankfurt am Main 11, Federal Republic of Germany</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">27/8(1990-09-01), 749-780</subfield>
   <subfield code="x">0001-5903</subfield>
   <subfield code="q">27:8&lt;749</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">27</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>
