Keyword Search
Advanced Search
NPTEL
click here to open
 Electronics & Communication Engineering

 Computer Science and Engineering
Artificial Intelligence
Introduction to Problem Solving and Programming
computer graphics
Principles of Programming Languages
Discrete Mathematical Structures
System Analysis and Design
Data Structures And Algorithms
Data Communication
Computer Networks
Internet Technology
Computer Architecture
Design and Analysis of Algorithms
Software Engineering
Database Design
Artificial Intelligence 2
Computer Organization
Computer Graphics(Intro.)
Theory of Automata, Formal Languages and Computation
Real Time Systems
Electronic Design Automation
Compiler Design
High Performance Computing
Programming and Data Structure
Cryptography and Network Security
High Performance Computer Architecture
Graph Theory
Computational Geometry
Logic for CS
Low Power VLSI Circuits & Systems
Natural Language Processing
Numerical Optimization
Performance Evaluation of Computer Systems
Theory of Computation
Parallel Algorithm
Computer Algorithms - 2
Biometrics
Storage Systems
Riemann Hypothesis and its Applications
Principles of Compiler Design
Introduction to Computer Graphics
Parallel Computing
Pattern Recognition
Artificial Intelligence-3
Combinatorics
Design Verification and Test of Digital VLSI Circuits
Functional Programming in Haskell
Programming, Data Structures and Algorithms
Programming and Data structures (PDS)
Model Checking
Introduction to programming in C
Computer Architecture - 2
Artificial Intelligence: Knowledge Representation and Reasoning
Virtual Reality
Compiler Design - II
Computer Architecture - 3
Information Security - II
Design and Analysis of Algorithms-2
Introduction to Machine Learning
Fundamentals of Database Systems
Introduction to Information Security I
Introduction to Operating Systems
Algorithms for Big Data
Introduction to Machine Learning-2
Programming, Data Structures and Algorithms in Python
Wireless Ad Hoc and Sensor Networks
Reinforcement Learning
Internetwork Security
Privacy and Security in Online Social Networks
Information Security-3
Natural Language Processing-2
Embedded Systems Design
AI:Constraint Satisfaction
VLSI Physical Design
Introduction to Modern Application Development
Synthesis of Digital Systems
Information security - IV
Deep Learning
The Joy of Computing
Blockchain Architecture Design and Use Cases

 Electrical Engineering

 Basic Courses (Sem I & II)

 Mechanical Engineering

 Civil Engineering

 Ocean Engineering

 Biotechnology

 Mining Engineering

 Metallurgy and Material Science

 Aerospace Engineering

 Chemical Engineering

 Management

 Mathematics

 Physics

 Humanities and Social Sciences

  Engineering Design

 Chemistry and Biochemistry

  Atmospheric Science

 Textile Engineering

 Nanotechnology

 Agriculture

 General
CIET
click here to open
  Quick Links  
   
Computer Science and Engineering  Theory of Automata, Formal Languages and Computation
   
 
Title: Theory of Automata, Formal Languages and Computation
Department: Computer Science and Engineering
Author: Prof. Kamala Krithivasan
University: IIT Madras
Type: WebLink
Abstract: Grammars ' Production systems ' Chomskian Hierarchy ' Right linear grammar and Finite state automata ' Context free grammars ' Normal forms ' uvwxy theorem Parikh mapping ' Self embedding property ' Subfamilies of CFL ' Derivation trees and ambiguity.

Finite state Automata ' Non deterministic and deterministic FSA, NFSA with ε' moves, Regular Expressions ' Equivalence of regular expression and FSA .

Pumping lemma , closure properties and decidability. Myhill ' Nerode theorem and minimization ' Finite automata with output.

Pushdown automata ' Acceptance by empty store and final state ' Equivalence between pushdown automata and context'free grammars ' Closure properties of CFL ' Deterministic pushdown automata.

Turing Machines ' Techniques for Turing machine construction ' Generalized and restricted versions equivalent to the basic model ' Godel numbering ' Universal Turing Machine ' Recursively enumerable sets and recursive sets ' Computable functions ' time space complexity measures ' context sensitive languages and linear bound automata.

Decidability; Post's correspondence problem; Rice's theorem; decidability of membership, emptiness and equivalence problems of languages.

Time and tape complexity measures of Turing machines; Random access machines; the classes P and NP; NP'Completeness; satisfiability and Cook's theorem; Polynomial reduction and some NP'complete problems.

Advanced topics; Regulated rewriting L systems; Grammar systems.

New paradigms of computing; DNA computing; Membrane computing.
 
   
Bodhbridge, Copyright © 2009 All rights reserved.,btechguru.com is a portal by BodhBridge ESPL.