TOC (UNIT 2 TO UNIT 5) all topics covered!!!
TOC (UNIT 2 TO UNIT 5) all topics covered!!! 2
TOC (UNIT 2 TO UNIT 5) all topics covered!!! 3
TOC (UNIT 2 TO UNIT 5) all topics covered!!! 4

TOC (UNIT 2 TO UNIT 5) all topics covered!!!

Instant access Secure payment Bundle of 4 PDFs

About this PDF

Unit–II: Regular Expressions and Languages Introduction, Operators of RE, Precedence of operators, Algebraic laws for RE, Language to Regular Expressions, Equivalence of two REs, Kleene’s theorem. Conversions: RE to NFA, DFA, DFA to RE using Arden’s theorem, Pumping Lemma for Regular languages, Closure(union, intersection, complementation, concatenation, Kleene closure) and Decision properties of Regular languages( Membership, Emptiness,Finiteness and Infiniteness) The Myhill–Nerode Theorem Unit–III: Context Free Grammars (CFG) and Languages Formal Definition of Context Free Grammar, Sentential form, Derivation and Derivation Tree/ Parse Tree, Context Free Language (CFL), Ambiguous Grammar, writing grammar for language, Simplification of CFG: Eliminating Є-productions, unit productions, useless production, useless symbols, and Normal Forms- Chomsky normal form, Greibach normal form, Pumping Lemma for CFG, Closure properties of CFL, Chomsky Hierarchy, Applications of CFG:-Palindromes, Parenthesis Match ,Parser, Markup languages, XML and Document Type Definitions. Unit-IV: Push Down Automata Introduction, Formal definition of PDA, Equivalence of Acceptance by Final State & Empty stack, Non-deterministic PDA (NPDA), PDA & Context Free Language, Equivalence of PDA and CFG, PDA vs CFLs. Applications of PDA,Introduction to Post Machine Unit V: Turing Machine and Computability Theory Turing machine (TMs): Basic model, definition, and representation, TM Instantaneous Description, Transition Function, Language accepted TM, Deterministic Turing Machines (DTM), and Construction of DTM. Universal Turing Machine (UTM), Church-Turing hypothesis, Comparison between FA, PDA and TM. Turing Machine Halting Problem. Decidable Problems and Undecidable Problems, Church-Turing Thesis. Reducibility: Undecidable Problems that are recursively enumerable, A Simple Undecidable. Complexity Classes: Time and Space Measures, The Class P, Examples of problems in P, The Class NP, Examples of problems in NP, P Problem Versus NP Problem, NP-completeness and hard Problems.

What you get

Instant access to all 4 PDFs right after payment
Each PDF opens exactly as sold on its own page
Secure UPI / card / netbanking checkout

Details

Format
Bundle of 4 PDFs
Language
English
Sold by
Disha Singh
Published
21 November 2026
One-time price · instant access
₹120₹140 4 PDFs

You save ₹20 with this bundle


Secure UPI / card / netbanking · Instant access

Already bought this? Open My purchases