<?xml version="1.0" encoding="UTF-8" ?>
<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xmlns:slims="http://slims.web.id" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3" id="21536">
 <titleInfo>
  <title>Theory of automata, formal languages and computation</title>
 </titleInfo>
 <name type="Personal Name" authority="">
  <namePart>S. P. Eugene Xavier</namePart>
  <role>
   <roleTerm type="text">Additional Author</roleTerm>
  </role>
 </name>
 <typeOfResource manuscript="no" collection="yes">mixed material</typeOfResource>
 <genre authority="marcgt">bibliography</genre>
 <originInfo>
  <place>
   <placeTerm type="text">India</placeTerm>
   <publisher>New Age International Limited, Publishers, New Delhi</publisher>
   <dateIssued>2005</dateIssued>
  </place>
 </originInfo>
 <language>
  <languageTerm type="code">en</languageTerm>
  <languageTerm type="text">English</languageTerm>
 </language>
 <physicalDescription>
  <form authority="gmd">Book</form>
  <extent>xiiii   346 pages</extent>
 </physicalDescription>
 <note>This book deals with a fascinating and important subject which has the&#13;
fundamentals of computer hardware, software and some of their applications.&#13;
This book is intended as an introductory graduate text in computer science&#13;
theory. I have taken care to present the material very clearly and interestingly.&#13;
As an introductory subject to computer science, this book has been written&#13;
with major stress on worked examples. Chapter 0 covers the basics required&#13;
for this subject viz., sets, relations, functions, graphs, trees, languages, and&#13;
fundamental proof techniques.&#13;
Chapter 1 deals with the different aspects of Deterministic Finite&#13;
Automata (DFA) and Non-Deterministic Finite Automata (NFA). A brief&#13;
introduction to pumping lemma and some theorems relating to Regular Sets&#13;
have also been given.&#13;
Chapter 2 covers the concepts relating to context free grammar viz.,&#13;
derivation trees, parsing, ambiguity, and normal forms. Chapter 3 deals with&#13;
Pushdown Automata and their relation to Context-Free Grammar with some&#13;
introduction to decision algorithms.&#13;
Chapter 4 deals with the Turing Machine model and the variations of&#13;
Turing Machines with introduction to Church-Turing Thesis and the concept&#13;
of undecidability. Chapter 5 explains the concepts viz., regular grammars,&#13;
unrestricted grammars and Chomsky hierarchy of languages.&#13;
Chapter 6 deals with the different aspects of computability with an&#13;
introduction to formal systems, recursive functions, primitive recursive&#13;
functions, and recursion. Chapter 7 covers the various aspect of complexity&#13;
theory such as polynomial time algorithms, non-polynomial time algorithm&#13;
class P and NP problems.&#13;
Chapter 8 covers propositions and predicates with lot of illustrative&#13;
examples.&#13;
I wish to thank my teachers who helped me to get a good grasp of the&#13;
subject and for having motivated me to write this book.&#13;
I want to place on record my sincere thanks to my family?Shri. Papu&#13;
Antony, my father; Mrs. Maria Daisy, my mother; Mrs. Assumpta Eugene, my&#13;
wife; and Ms. E. Catherine Praveena, my only daughter, for their great&#13;
patience and prayers while I was writing this book.</note>
 <note type="statement of responsibility">S. P. Eugene Xavier</note>
 <subject authority="">
  <topic>Computer Science Software Engineering</topic>
 </subject>
 <subject authority="">
  <topic>data Science</topic>
 </subject>
 <subject authority="">
  <topic>1. Computer Science 2. Software Engineering 3. Dat</topic>
 </subject>
 <subject authority="">
  <topic>Data Science Information Technology</topic>
 </subject>
 <subject authority="">
  <topic>1. Computer Science 2.software engineering Softwar</topic>
 </subject>
 <classification>511.3</classification>
 <identifier type="isbn">9786611224486</identifier>
 <location>
  <physicalLocation>NUML LIBRARY RAWALPINDI (National University of Modern Languages) NUML library is the state of art which equipped “RESEARCH FACILITATION CENTRE” with latest computers for readers to access the digital library of more than 23000 research journals and 130000 online books and E-Library of NUML-Rawalpindi.</physicalLocation>
  <shelfLocator>511.3 XAV</shelfLocator>
  <holdingSimple>
   <copyInformation>
    <numerationAndChronology type="1">14282</numerationAndChronology>
    <sublocation></sublocation>
    <shelfLocator></shelfLocator>
   </copyInformation>
  </holdingSimple>
 </location>
 <slims:image>14282.jpeg.jpeg</slims:image>
 <recordInfo>
  <recordIdentifier>21536</recordIdentifier>
  <recordCreationDate encoding="w3cdtf">2026-02-02 16:13:07</recordCreationDate>
  <recordChangeDate encoding="w3cdtf">2026-02-03 14:08:38</recordChangeDate>
  <recordOrigin>machine generated</recordOrigin>
 </recordInfo>
</mods>
</modsCollection>