Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
3Activity

Table Of Contents

0.1BASICS
0.1.1Sets
0.1.2Rela tions and Func tions
0.1.3Graphs and Trees
0.1.4Strings and Lan guages
0.1.5Boolean Logic
GLOSSARY
REVIEW QUESTIONS
EXERCISES
SHORT QUESTIONS AND ANSWERS
1.1.2Types of Autom a ton
1.2NON-DETERMINISTIC FINITE AUTOMATA (NFA)
1.3EQUIVALENCE OF NFA AND DFA
1.4REGULAR EXPRESSION
1.4.4Lan guages defined by Reg u lar Expres sions
1.5TWO-WAY FINITE AUTOMATA
1.6FINITE AUTOMATA WITH OUTPUT
1.6.2Mealey Machine
1.6.3Moore Machine
1.7PROPERTIES OF REGULAR SETS (LANGUAGES)
1.7.1Clo sure
1.8PUMPING LEMMA
1.8.1Prin ci ple of Pumping Lemma
1.8.2Applying the Pumping Lemma
1.9CLOSURE PROPERTIES OF REGULAR LANGUAGES
1.10MYHILL-NERODE THEOREM
1.10.1Myhill-Nerode Rela tions
1.10.2Myhill-Nerode The o rem
2.1INTRODUCTION
2.1.2Exam ple of CFG
2.1.3Right-Lin ear Gram mar
2.1.4Right-Lin ear Gram mars and NFAs
2.1.5Left-Lin ear Gram mar
2.2DERIVATION TREES
2.2.2Sentential Form
2.3PARSING AND AMBIGUITY
2.3.1Parsing
2.3.2Exhaus tive Search Parsing
2.3.3Top down/Bottomup Parsing
2.4SIMPLIFICATION OF CFG
2.5NORMAL FORMS
2.5.1Chomsky Nor mal Form (CNF)
SHORT-QUESTIONS AND ANSWERS
3.1DEFINITIONS
3.1.1Nondeterministic PDA (Def i ni tion)
3.1.3Draw ing NPDAs
3.1.5Accepting Strings with an NPDA
3.1.7Accepting Strings with NPDA (For mal Ver sion)
3.2.1Sim plifying CFGs
3.2.3CFG to NPDA
3.2.4NPDA to CFG
3.3PROPERTIES OF CONTEXT FREE LANGUAGES
3.3.1Pumping Lemma for CFG
3.3.3Proof of Pumping Lemma
3.3.4Usage of Pumping Lemma
3.4DECISION ALGORITHMS
4.1.6How to Recognize a Language
4.1.7Turing Machines as Trans ducers
4.2COMPLETE LANGUAGES AND FUNCTIONS
4.3MODIFICATION OF TURING MACHINES
4.3.1N-Track Turing Machine
4.4CHURCH–TURING’S THESIS
4.4.1Counting
4.4.2Recur sive and Recur sively Enumerable Lan guage
4.4.4Non-recur sively Enumerable Lan guages
4.5UNDECIDABILITY
4.5.1Halting Prob lem
4.5.3Reduc tion to Halting Prob lem
4.6RICE’S THEOREM
5.1CONTEXT SENSITIVE GRAMMARS AND LANGUAGES
5.2LINEAR BOUNDED AUTOMATA
5.3RELATIONSHIP OF OTHER GRAMMARS
5.4THE CHOMSKY HIERARCHY
5.5EXTENDING THE CHOMSKY HIERARCHY
5.6UNRESTRICTED GRAMMAR
5.7RANDOM-ACCESS MACHINE
6.1FORMAL SYSTEMS
6.2RECURSIVE FUNCTION THEORY
6.3PRIMITIVE RECURSIVE FUNCTIONS
6.4COMPOSITION AND RECURSION
6.5ACKERMANN’S FUNCTION
7.1INTRODUCTION
7.2POLYNOMIAL-TIME ALGORITHMS
7.3NON-DETERMINISTIC POLYNOMIAL TIME ALGORITHMS
7.4INTEGER BIN PACKING
7.5BOOLEAN SATISFIABILITY
7.6ADDITIONAL NP PROBLEMS
7.7NP-COMPLETE PROBLEMS
8.1PROPOSITIONS
8.2LOGICAL INFERENCE
8.3PREDICATES AND QUANTIFIERS
8.4QUANTIFIERS AND LOGICAL OPERATORS
8.5NORMAL FORMS
Answers to Exer cises
Index
0 of .
Results for:
No results containing your search query
P. 1
32730598 Theory of Automata Computation Formal Languages

32730598 Theory of Automata Computation Formal Languages

Ratings: (0)|Views: 1,267|Likes:
Published by Rajesh Pedamutti

More info:

Published by: Rajesh Pedamutti on Nov 25, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

11/10/2011

pdf

text

original

You're Reading a Free Preview
Pages 8 to 67 are not shown in this preview.
You're Reading a Free Preview
Pages 81 to 196 are not shown in this preview.
You're Reading a Free Preview
Pages 204 to 360 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->