<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Introduction to the theory of computation</title>
  </titleInfo>
  <name type="personal">
    <namePart>Sipser, Michael.</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <genre authority="">Machine theory.</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">mau</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Boston ; Toronto</placeTerm>
    </place>
    <publisher>PWS</publisher>
    <dateIssued>c1997</dateIssued>
    <dateIssued encoding="marc">1997</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xv, 396 p. : ill.</extent>
  </physicalDescription>
  <note type="statement of responsibility">Michael Sipser.</note>
  <note>Bibliographie: p. 381-385.</note>
  <subject>
    <topic>Automate</topic>
    <topic>Calcul</topic>
    <topic>Calculabilite</topic>
    <topic>Calculateur</topic>
    <topic>Complexite</topic>
    <topic>Formel</topic>
    <topic>Informatique</topic>
    <topic>Langage</topic>
    <topic>Machine</topic>
    <topic>Mathematique</topic>
  </subject>
  <subject>
    <topic>Programmation</topic>
    <topic>Theorie</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Computational complexity</topic>
  </subject>
  <subject>
    <topic>Complejidad computacional</topic>
  </subject>
  <subject authority="rvm">
    <topic>Complexité de calcul (Informatique)</topic>
  </subject>
  <subject authority="ram">
    <topic>Complexité de calcul (informatique)</topic>
  </subject>
  <subject authority="ram">
    <topic>Informatique</topic>
    <topic>Modáeles mathâematiques</topic>
  </subject>
  <subject authority="ram">
    <topic>Turing, Machines de</topic>
  </subject>
  <subject authority="ram">
    <topic>Décidabilité (logique mathâematique)</topic>
  </subject>
  <subject authority="inriac">
    <topic>calculabilité</topic>
  </subject>
  <subject authority="inriac">
    <topic>automate</topic>
  </subject>
  <subject authority="inriac">
    <topic>langage formel</topic>
  </subject>
  <subject authority="inriac">
    <topic>complexité calcul</topic>
  </subject>
  <subject authority="inriac">
    <topic>théorie machine</topic>
  </subject>
  <classification authority="lcc">QA 267 S618i 1997</classification>
  <identifier type="isbn">053494728X</identifier>
  <identifier type="isbn">9780534947286</identifier>
  <identifier type="lccn">96035322</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">RUQBL</recordContentSource>
    <recordCreationDate encoding="marc">960906</recordCreationDate>
    <recordChangeDate encoding="iso8601">20230410132735.0</recordChangeDate>
    <recordIdentifier>81704</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">fre</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
