• Home
  • GATE Subjects
    • Database Management System
    • Computer Networks
    • Operating System
    • Computer Organization & Architecture
    • Data Structures
    • Theory of Automata & Computation
    • Compiler Design
    • Graph Theory
    • Design and Analysis of Algorithms
    • Digital Design
    • Number System
    • Mathematics
      • Propositional Logic
    • Programming Languages
      • Core Java
  • B.Tech Subjects
    • Computer Graphics
    • Machine Learning
    • Artificial Intelligence
    • Pattern Recognition
    • Software Engineering
  • GATE 2022
  • GATE CSE Books
  • Job Opportunities
  • Contact Us
  • Subscribe

Theory of Automata & Computation Notes

Theory of Automata & Computation Books

 

Recommended Books By Gate Vidyalay

 

  • Formal Languages and Automata By Peter Linz
  • Automata Theory, Languages & Computation By Ullman
  • Introduction to Theory of Computation By Michael Sipser

 

Why You Should Read Book By Peter Linz?

 

Theory of Automata & Computation Books

 

Theory of Automata & Computation Notes

 

Deterministic Finite Automata-

 

  • Construction of DFA | Type-01
  • Construction of DFA | Type-02
  • Minimization of DFA
  • DFA to Regular Expression | State Elimination Method
  • DFA to Regular Expression | Arden’s Theorem

 

Non-Deterministic Finite Automata-

 

  • Non-Deterministic Finite Automata
  • Converting NFA to DFA

 

Grammar Formalism-

 

  • Parse Tree | Derivations
  • Left Recursion | Elimination
  • Types of Grammars
  • Ambiguous & Unambiguous Grammar
  • Recursive & Non-Recursive Grammar

 

Ambiguous Grammar-

 

  • Ambiguous Vs Unambiguous Grammar
  • Checking whether Grammar is Ambiguous
  • Converting Ambiguous into Unambiguous Grammar
  • Evaluating Expressions Based on Given Grammar
  • Important Points for Exams

 

Language of Grammar-

 

  • Language of Grammar
  • Language Ambiguity

 

Context Free Grammar-

 

  • Context Free Grammar

 

Normal Forms-

 

  • Chomsky Normal Form

 

Decision Algorithms of CFG-

 

  • To decide whether CFL is empty or not
  • To decide whether CFL is finite or not
  • To decide membership of CFG | CKY Algorithm

 

More Articles Coming Soon…Subscribe To Receive Email Notifications!

Follow us on Facebook

Follow us on Instagram

Choose your Subject

 

GATE Subjects

Database Management System

Computer Networks

Operating System

Computer Organization & Architecture

Data Structures

Theory of Automata & Computation

Compiler Design

Graph Theory

Design & Analysis of Algorithms

Digital Design

Number System

Discrete Mathematics

 

B.Tech Subjects

Computer Graphics

Machine Learning

Artificial Intelligence

Pattern Recognition

Software Engineering

Popular GATE Books

Look Inside This Book

 

Look Inside This Book

 

Job Opportunities

Recommended Books

Why This Book?

 

 

Popular Gate Books

Gate Vidyalay © 2020 Managed by MetaDiv Systems