BE in Computer Science
Pursuing ME in CSE
Cleared GATE 2017 and 2018

Priyanka Bhati

This course contains the explanation of Regular Language and some important question to check whether a language is regulare or not

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) Questions On Regular Language (TOC)

Regular Expression

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

Overview Of The Course (in Hindi)

What Is A Regular Language (in Hindi)

Some Important Points (in Hindi)

How To Check A Language Is Regular Or Not (in Hindi)

How To Check A Language Is Regular Or Not -2 (in Hindi)

This lesson contains previous year questions on Regular Language

Previous Year GATE Questions (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 cover 100 questions with short tricks related to regular Expressions from theory of Computation targeted for GATE & UGC NET Exam.

(Hindi) 100 Questions: Regular Expressions in Theory of Computation for GATE (CS and IT)

In this course, Sweta Kumari will cover Short Tricks for Writing Regular Expressions with Master SRP.

(Hindi) Short Tricks for Writing Regular Expressions with Master SRP : GATE (CS and IT)

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 discusses Regular Expression is a declarative way of representation of a regular language. The course will be beneficial for GATE (CS and IT).

(Hindi) Theory of Computation - Regular Expression: GATE(CS & IT)

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

Rachana Pathak

This course will enhance your ability to derive Regular Expression from Regular Language

(Hindi) Regular Expressions - 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.

Lessons

6 lessons • 1h 6m