<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01131cam a2200241Mi 4500</leader>
  <controlfield tag="001">on1040242298</controlfield>
  <controlfield tag="003">OCoLC</controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">210519s2018    ii a          000 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9789386768070 (pbk.)</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9386768070</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(OCoLC)1040242298</subfield>
    <subfield code="z">(OCoLC)1037040877</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2=" ">
    <subfield code="a">QA267</subfield>
    <subfield code="b">.S29 2018</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Saxena, Shivam.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Automata theory, language of machines and computability /</subfield>
    <subfield code="c">Shivam Saxena.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">New Delhi :</subfield>
    <subfield code="b">I.K. International Publishing House,</subfield>
    <subfield code="c">c2018.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xiv, 311 p. :</subfield>
    <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">Introduction to Theory of Computation -- Finite Automata -- Finite Automata as Transducers -- Regular Expressions and Regular Grammar -- Context Free Grammars -- Normal Forms of Context Free Grammars -- Pushdown Automata -- Turing Machines -- Hierarchy of Formal Languages and Automata -- Introduction to Undecidability -- Recursive Function Theory -- Computational Complexity and Its Classes -- Solution to Exercises -- Index.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">Machine theory.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">Computable functions.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">Computer science</subfield>
    <subfield code="x">Mathematics.</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">lcc</subfield>
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">PNLIB</subfield>
    <subfield code="b">PNLIB</subfield>
    <subfield code="c">GEN</subfield>
    <subfield code="d">2021-06-17</subfield>
    <subfield code="o">QA267 .S29 2018</subfield>
    <subfield code="p">PNLIB21062554</subfield>
    <subfield code="r">2021-06-17</subfield>
    <subfield code="w">2021-06-17</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">2741</subfield>
    <subfield code="d">2741</subfield>
  </datafield>
</record>
