MCA from NIT Agartala, passionate for sharing knowledge

Bharat Verma

This course will give the learners understanding of formal language and automata theory, to know the importance of Deterministic Finite Automata (DFA) and how to draw a DFA

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) Deterministic Finite Automata

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 will give you the basic understanding of Theory of Computation and Automata theory and help you to understand the need of Deterministic Finite Automata and how to draw it.

1. How To Draw A Deterministic Finite Automata (in Hindi)

This lesson will help you in understanding the basic concepts of how to draw a DFA to accept a particular pattern in a string.

2. How To Draw A DFA To Accept A Particular Pattern In Strings (in Hindi)

To give the learners proper understanding on different types of problems on DFA for acceptance of a particular pattern in a string

3. Some More Examples On DFA To Accept A Particular Pattern In Strings (in Hindi)

To give the learners concept of drawing a DFA for the divisibility of numbers by 2, 3 and 5.

4. How To Draw A DFA To Check Divisibility Of Numbers (in Hindi)

To give the learners concept of real life applications and advantages of DFA and how to draw DFA for a real life example

5. Real Life Applications And Advantages Of DFA (in Hindi)

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

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 in Computer Science
Pursuing ME in CSE
Cleared GATE 2017 and 2018

Priyanka Bhati

This course is a crash course of TOC. TOC is a very important subject in GATE CS and IT and it can be mastered with this course. This contains theoritical explanation of each topic and also the solutions of previous year GATE questions of TOC.

Theory of Computation(TOC) - GATE 2019

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 • 55m

Invalid Date

NaN

1. How To Draw A Deterministic Finite Automata (in Hindi)

Invalid Date

NaN

2. How To Draw A DFA To Accept A Particular Pattern In Strings (in Hindi)

Invalid Date

NaN

3. Some More Examples On DFA To Accept A Particular Pattern In Strings (in Hindi)

Invalid Date

NaN

4. How To Draw A DFA To Check Divisibility Of Numbers (in Hindi)

Invalid Date

NaN

5. Real Life Applications And Advantages Of DFA (in Hindi)