Rashmi Vishwakarma

Here in this course, we cover Theory of Computation for NTA UGC NET Computer science with all topics like DFA, NFA, PDA, Turing machine, Grammar, decidability and unadecidebility with MCQ, PYQs and revision notes.

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

Hindi

(Hindi) 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 for NTA UGC NET Computer science, syllabus and pattern of questions asked in previous years.

Introduction to the Course - Theory of Computation (in Hindi)

Why to learn Theory of computation. Relationship between finite automata and Computer Science.

Origin of Theory of Computation/ TOC (in Hindi)

Basics Concept (Alphabet, Strings) in Theory of Computation (in Hindi)

How to make language in theory of computation.

Basics Concept (Language) in Theory of Computation (in Hindi)

Introduction to Finite Automata in Theory of Computation (in Hindi)

Notation to represent DFA - NTA UGC NET Computer Science.

DFA notation - TOC - NTA UGC NET Computer Science

Numericals on DFA - part 1- NTA UGC NET Computer Science

Numericals based on DFA. NTA UGC NET Computer Science.

Numericals on DFA part 2 - NTA UGC NET Computer Science

Numerical based on the DFA - NTA UGC NET Computer Science.

Numericals on DFA part 3 - NTA UGC NET Computer Science

Solution to practice questions based on DFA.

Solution to practice question 1- NTA UGC NET Computer Science

Solution to practice questions based on DFA and conclusion.

Solution to practice question 2

Solution to practice question 3- NTA UGC NET Computer Science

Union of DFA in TOC- NTA UGC NET Computer Science

Concatenation of DFA - NTA UGC NET Computer Science

Complementation of DFA in TOC - NTA UGC NET Computer Science

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

Reversal of DFA in TOC- NTA UGC NET Computer Science

Introduction to NFA in TOC- NTA UGC NET Computer Science

How to convert NFA into DFA in TOC- NTA UGC NET Computer Science and GATE CSE

Example NFA to DFA part 2- NTA UGC NET Computer Science and GATE CSE

Introduction to the epsilon- NFA.

How to convert epsilon- NFA to NFA in TOC- NTA UGC NET Computer Science.

Introduction to the minimization of DFA in TOC.

Minimization of DFA in TOC- NTA UGC NET Computer Science and GATE CSE

Numerical example of minimization of DFA in TOC..

Example of minimization of DFA in TOC- NTA UGC NET computer science

Numerical example of minimization of DFA.

Example of Minimization of DFA in TOC- NTA UGC NET Computer Science.

Introduction to the Finite State Machine - Moore and Mealy machine

Introduction to Finite State Machine - Moore and Mealy Machine pàrt 2

Conversion of Moore Machine to Mealy Machine.

Conversion of Moore 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 to previous years questions based on Finite automata

Solution to previous years questions based on finite automata part 2.

Solution to previous years questions based on Finite Automata part 2

Solution to previous years questions of Theory of Computation

Solution to previous years questions based on Theory of Computation

🌟 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 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

(Hindi ) Function-related Important Questions: NTA-UGC NET

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 .

Lessons

32 lessons • 4h 1m

Invalid Date

NaN

Introduction to the Course - Theory of Computation (in Hindi)

Invalid Date

NaN

Origin of Theory of Computation/ TOC (in Hindi)

Invalid Date

NaN

Basics Concept (Alphabet, Strings) in Theory of Computation (in Hindi)

Invalid Date

NaN

Basics Concept (Language) in Theory of Computation (in Hindi)

Invalid Date

NaN

Introduction to Finite Automata in Theory of Computation (in Hindi)

Invalid Date

NaN

DFA notation - TOC - NTA UGC NET Computer Science

Invalid Date

NaN

Numericals on DFA - part 1- NTA UGC NET Computer Science

Invalid Date

NaN

Numericals on DFA part 2 - NTA UGC NET Computer Science

Invalid Date

NaN

Numericals on DFA part 3 - NTA UGC NET Computer Science

Invalid Date

NaN

Solution to practice question 1- NTA UGC NET Computer Science

+ See all lessons