I am a self motivated person with a positive attitude towards life and work. My dream is to work in a professional environment.

Shivam Pandey

In this course we will cover some important topics of CHOMSKY HIERARCHY and CHOMSKY NORMAL FORM.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE & ESE

Hindi

(HINDI) Theory of Computation: Chomsky Hierarchy and Chomsky Normal Form

GATE (Graduate Aptitude Test In Engineering) Preparation

Context Free Grammar

Theory of Computation

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

In this lesson, we will discuss the types of Grammar.

Types Of Grammar (in Hindi)

In this lesson we will learn what is CHOMSKY HIERARCHY and Detailed discussion on it's Graph.

CHOMSKY Hierarchy (in Hindi)

In this lesson we will learn what is CHOMSKY NORMAL FORM and what are the steps to reduce CFG to CHOMSKY NORMAL FORM.

CHOMSKY Normal Form (in Hindi)

In this lesson we have solved questions to convert CFG to CHOMSKY normal form.

Questions on CHOMSKY Normal Form: Part 1 (in Hindi)

In this lesson we will solve questions to convert CFG to CHOMSKY Normal form.

Questions on CHOMSKY Normal Form: Part 2 (in Hindi)

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

In this course, Sweta Kumari will explain about Context-free Grammar and how to create them, Push down automata and its types and many more.

(Hindi) Context Free Grammar and Push Down Automata

Hello !myself shubham vijay kogade, studying  computer engineering at sinhgad institute pune, Educator in Unacademy..

Shubham Kogade

This course discusses Right Linear Grammar and Conversion from DFA to RLG or RLG to DFA.

(Hindi) Context Free Grammars

M.Tech @ NSIT Delhi/GATE (CS) 2017&2018 qualified ...Not a teacher but a medium of sharing my knowledge 

Akshay Mandhare

In this course Akshay Mandhare will explain about Context free grammar  how to create them,Push down automata and its types,etc

(Hindi)Theory Of Computation: Context-Free Grammar And Push Down Automata

This course will cover Turing Machine, undecidability concepts and previous year questions asked in GATE from this topic. The course will be beneficial for GATE Aspirants.

(Hindi) Turing Machine - Undecidability Concepts and PYQ's: GATE (CS and IT)

In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. In this course, Shivam will discuss PDA and Turing machine and will solve some questions on it.

(Hindi) Theory of Computation - Push Down Automata (PDA)

A Turing machine is a mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules. In this course, Shivam will discuss Turing Machine and will solve some questions on it.

Lessons

5 lessons • 50m

Invalid Date

NaN

Types Of Grammar (in Hindi)

Invalid Date

NaN

CHOMSKY Hierarchy (in Hindi)

Invalid Date

NaN

CHOMSKY Normal Form (in Hindi)

Invalid Date

NaN

Questions on CHOMSKY Normal Form: Part 1 (in Hindi)

Invalid Date

NaN

Questions on CHOMSKY Normal Form: Part 2 (in Hindi)