<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00888nam a2200193Ia 4500</leader>
  <controlfield tag="001">CTU_194844</controlfield>
  <controlfield tag="008">210402s9999    xx            000 0 und d</controlfield>
  <datafield tag="082" ind1=" " ind2=" ">
   <subfield code="a">511.35</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
   <subfield code="b">G578</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
   <subfield code="a">Goddard, Wayne</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
   <subfield code="a">Introducing the theory of computation</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
   <subfield code="c">Wayne Goddard.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="a">Sudbury, Mass.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="b">Jones and Bartlett Publishers</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="c">2008</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and an introduction to complexity theory</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
   <subfield code="a">Machine theory.,Computational complexity.,Độ phức tạp của máy điện toán</subfield>
  </datafield>
  <datafield tag="904" ind1=" " ind2=" ">
   <subfield code="i">Tuyến</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
   <subfield code="a">Trung tâm Học liệu Trường Đại học Cần Thơ</subfield>
  </datafield>
 </record>
</collection>
