I am an unacademy educator sharing knowledge for engineering students as well as English learning aspirants.

Pavneet Kaur

This course gives detailed explanation on Pushdown automata and Turing machines along with the sums which adds up to the clarity of the concept.

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 - Iconic Pro

Hindi

(Hindi) Automata - GATE

Finite Automata

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

This lesson is the introduction to pushdown automata and it's mathematical representation

Pushdown Automata Part-1 (in Hindi)

This lesson is about push ,pop and skip operations of PDA along with the example of context free language.

Operations And Sums Of Pushdown Automata Part-2 (in Hindi)

This lesson includes more important sums and their detailed explanation in designing the  Pushdown automata.

More Examples On Pushdown Automata Part-3 (in Hindi)

This lesson introduces to Turing machine . Turing machine is defined using mathematical definition.

Turing machine Part-4 (in Hindi)

This lesson is about the explanation of Turing machine with the help of very important sums of Turing machine.

Sums On Turing Machine Part-5 (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

This course will go through you some tips & tricks to Solve Regular Expression For Finite Automata. Firstly, I have discussed Regular Expression Examples , Identities & Example Problems, Arden's Theorem, NFA to Regular Expression Conversion,DFA to Regular Expression Conversion.

(Hindi) Tips & Tricks For Regular Expressions in TOC: GATE

This course will let you know the difference between Deterministic Finite Automata (DFA) and Non - Deterministic Finite Automata (NFA) with examples. This course also explains you some of  the key points that will helpful for your Exams.

(Hindi) Finite Automata in TOC - GATE (CS/IT)

In this course , I will cover GATE Previous Year Questions On Regular Languages & Finite Automata With Detailed Analysis.

(Hindi) GATE PYQs: Regular Languages & Finite Automata

BE , ME (Computer Science Engineering)
3 years of Experience in teaching Engineering students.

Rachana Pathak

In this course, the educator discusses the Minimization Of DFA or Minimal DFA. The course will be beneficial for GATE Aspirants.

(Hindi) Part 1: Minimal DFA or Minimization Of DFA

I am pursuing M.tech from Lovely professional University in CSE.I have other talent which is Trading.

Nikhil Ravi

In this course, educator will be teaching about
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation. It is difficult to circumscribe the theoretical areas precisely.

Theory of Computer Science - GATE (CS and IT)

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.

Lessons

5 lessons • 1h 3m

Invalid Date

NaN

Pushdown Automata Part-1 (in Hindi)

Invalid Date

NaN

Operations And Sums Of Pushdown Automata Part-2 (in Hindi)

Invalid Date

NaN

More Examples On Pushdown Automata Part-3 (in Hindi)

Invalid Date

NaN

Turing machine Part-4 (in Hindi)

Invalid Date

NaN

Sums On Turing Machine Part-5 (in Hindi)