Rashmi Vishwakarma

This course will cover all concepts of theory of computation that includes DFA NFA PDA Turing machine Grammer and decidability.

Prepare for UGC NET 2019 by watching our free online lessons covering UGC Net syllabus and also helping you solve Previous year question papers. Pursue your dream of JRF.

NTA-UGC-NET & SET Exams

English

Theory of Computation - NTA UGC NET

Discrete Probability

Discrete Structure & Optimization

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

Introduction to the course- Theory of Computation.

Introduction to the Course- Theory of Computation

Origin of Theory of Computation/ TOC

Basic concept of toc like alphabet and string.

Basic Concept (Alphabet, String ) in Theory of Computation

Basic Concept (Language) in Theory of Computation

Introduction to the finite automata in theory of computation.

Introduction to the Finite Automata in Theory of Computation

DFA Notation - Theory of Computation/TOC

Numerical based on DFA and practice questions.

Numerical based DFA part 1- Theory of Computation/TOC- NTA UGC NET Computer Science

Numerical based on DFA part 2. - Theory of Computation

Numerical based on DFA part 3

Solution to practice questions based on DFA in TOC.

Solution to practice question based on DFA part 1- TOC/ Theory of Computation

Solution to practice questions based on DFA part 2- Theory of Computation

Solution to practice questions based on DFA part 3 - Theory of Computation

Union of DFA in TOC- NTA UGC NET Computer Science.

Concatenation of DFA in TOC

Complementation of DFA in TOC

Reversal of the DFA in TOC

Introduction to the NFA in TOC- NTA UGC NET Computer Science

NFA to DFA conversion in TOC- NTA UGC NET Computer Science

NFA to DFA conversion part 2 in TOC- NTA UGC NET Computer Science

Minimization of DFA in TOC- NTA UGC NET Computer Science

Minimization of DFA example 1 in TOC- NTA UGC NET Computer Science

Minimization of DFA example 2 in TOC- NTA UGC NET Computer Science

Introduction to epsilon NFA in TOC for NTA UGC NET Computer Science

Conversion of epsilon NFA in equivalent NFA.

Example of conversion of epsilon NFA to NFA- NTA UGC NET Computer Science

Introduction to the finite state machine.

Introduction to the Finite State Machine - Moore and Mealy Machine

Introduction to Finite state machine - Moore and Mealy Machine part 2

Conversion of Moore Machine into Mealy Machine.

Conversion of Moore Machine to Mealy Machine in TOC for NTA UGC NET Computer Science

Conversion of Mealy to Moore Machine in TOC for NTA UGC NET Computer Science

Solution to previous years questions based on finite automata.

Solution of previous years questions based on Finite Automata part 1

Solution of previous years questions part 2

🌟 MCA Gold Medalist 🌟 Star Educator 🌟Gate Qualified 🔴UGC NET qualified🌟BOOK published on LINUX ADMINISTRATION by kalyani publish

Nisha Mittal

In this course, the educator Nisha Mittal will provide solutions of questions related to propositional logic. This topic is very important for UGC NET computer science, Gate, KVS PGT,  HTET aspirants

(Hindi) Propositional Logic-Computer Science: NTA UGC NET

In this course Nisha Mittal will provide solutions of questions of set theory for NTA NET computer science. Here you will understand all important topics of set theory with the help of questions .

(Hindi) Set Theory for NTA UGC NET Computer Science Examination

In this course Nisha Mittal will provide solutions of questions of graph theory.  Also you will understand  important topics with the help of these lessons .

(Hindi) Graph Theory Previous Year Question with Solution

In this course Nisha Mittal will provide topic detail and  solutions of questions of NTA NET computer science examination related to discrete structure topic : relation and Function.

(Hindi) Relation and Function for NTA UGC NET: Computer Science

In this course Nisha Mittal will provide solutions of Functions topic of discrete structure questions for NTA NET computer science examination. This course will be helpful to GATE computer science, KVS PGT, TGT computer science students also

Lessons

31 lessons • 2h 24m

Invalid Date

NaN

Introduction to the Course- Theory of Computation

Invalid Date

NaN

Origin of Theory of Computation/ TOC

Invalid Date

NaN

Basic Concept (Alphabet, String ) in Theory of Computation

Invalid Date

NaN

Basic Concept (Language) in Theory of Computation

Invalid Date

NaN

Introduction to the Finite Automata in Theory of Computation

Invalid Date

NaN

DFA Notation - Theory of Computation/TOC

Invalid Date

NaN

Numerical based DFA part 1- Theory of Computation/TOC- NTA UGC NET Computer Science

Invalid Date

NaN

Numerical based on DFA part 2. - Theory of Computation

Invalid Date

NaN

Numerical based on DFA part 3

Invalid Date

NaN

Solution to practice question based on DFA part 1- TOC/ Theory of Computation

+ See all lessons