<section name="raw">
    <SEQUENTIAL>
      <record key="001" att1="001" value="LIB903055806" att2="LIB903055806">001   LIB903055806</record>
      <field key="037" subkey="x">englisch</field>
      <field key="050" subkey="x">Buch</field>
      <field key="076" subkey="">Formalwissenschaft</field>
      <field key="100" subkey="">hopcroft, john e.</field>
      <field key="104" subkey="a">ullman, jeffrey d.</field>
      <field key="331" subkey="">formal languages and their relation to automata</field>
      <field key="403" subkey="">1. ed.</field>
      <field key="410" subkey="">reading, massachusetts, menlo park, california, london</field>
      <field key="412" subkey="">addison-wesley publishing company</field>
      <field key="425" subkey="">1969</field>
      <field key="433" subkey="">vii, 242 pp.</field>
      <field key="451" subkey="">addison-wesley series in computer science and information processing</field>
      <field key="451" subkey="h">harrison, michael a. (ed.) ; varga, richard s. (ed.)</field>
      <field key="517" subkey="c">from the table of contents: languages and their representations; grammars; finite automata and regular grammars; context-free</field>
      <field key="gra" subkey="m">mars; pushdown automata; turing machines; turing machines: the halting problem, type 0 languages; linear bounded automata and</field>
      <field key="con" subkey="t">ext-sensitive languages; operations on languages; time- and tape-bounded turing machines; time and space bounds for</field>
      <field key="rec" subkey="o">gnizing context-free languages; deterministic pushdown automata; stack automata; decidability;</field>
      <field key="544" subkey="">6499-A</field>
    </SEQUENTIAL>
  </section>