<?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>Automata, computability and complexity</title>
    <subTitle>theory and applications</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Rich, Elaine</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="text">India</placeTerm>
    </place>
    <publisher>Pearson Indian Education Services Pvt Ltd</publisher>
    <dateIssued>2012, 2019</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <physicalDescription>
    <extent>xx, 1099 p. : ill. ; 23 cm.</extent>
  </physicalDescription>
  <note>Includes bibliographical references, appendix and index.</note>
  <subject authority="lcsh">
    <topic>Machine theory Computable functions</topic>
    <topic>Computational complexity</topic>
    <topic>Programming tools</topic>
    <topic>Logical formulas</topic>
    <topic>Turing machine</topic>
    <topic>Finite machine</topic>
    <topic>Algorithms</topic>
    <topic>Networks</topic>
    <topic>FEAS</topic>
    <topic>FC</topic>
  </subject>
  <classification authority="ddc">511.3 RIC</classification>
  <identifier type="isbn">9788131788226 (pbk)</identifier>
  <recordInfo/>
</mods>
