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

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) 100 Questions: Regular Expressions in Theory of Computation for GATE (CS and IT)

Regular Expression

Theory of Computation

CS & IT

GATE - CSIT, DSAI & Placements

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Strategy to Crack Regular Expression in Theory of Computation (in Hindi)

15 Short Tricks : Convert Regular Expressions to Finite Automata {Beginner Level} (in Hindi)

10 Short Tricks : Convert Regular Expressions to Finite Automata {Medium Level} (in Hindi)

5 Short Tricks : Convert Regular Expressions to Finite Automata {High Level} (in Hindi)

15 Short Tricks : Regular Expressions Important Identities (in Hindi)

10 Short Tricks : Regular Expressions to Finite Automata + GATE PYQs (in Hindi)

15 Short Tricks : Convert Finite Automata To Regular Expression (in Hindi)

10 GATE PYQs on Regular Expressions (1991 - 2000) (in Hindi)

13 GATE PYQs - Regular Expressions (GATE 2003- 2015) (in Hindi)

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

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 series will help you in solving Regular Expressions and easily understand pumping Lemma Part-1

(Hindi)Pumping Lemma Part - 1 and Important Problems based on Odd-Even

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

9 lessons • 1h 58m