×
Create CV Books Summaries Online Courses Blog Communities

Login

Sign up
MindLuster Logo
Categories
Recent

Join Our Telegram Channel Now to Get Any New Free Courses : Click Here

Regular Expression Theory in Theory of Computation RegularExpression

Share your inquiries now with community members Click Here
Previous Lesson Next Lesson
Sign Up and Get Free Certificate
Sign up Now
Lesson extensions

Lessons List | 84 Lesson
Theory of Computation by Engineering Funda
00:06:17

Theory of Computation by Engineering Funda
Introduction to Theory of Computation Need of Theory of Computation Target Audience of TOC
00:07:25

Introduction to Theory of Computation Need of Theory of Computation Target Audience of TOC
Why study theory of Computation Theory of Computation TOC
00:07:48

Why study theory of Computation Theory of Computation TOC
Content Course flow in Theory of Computation Lecture Series Chomsky s Hierachy TOC
00:12:09

Content Course flow in Theory of Computation Lecture Series Chomsky s Hierachy TOC
Regular language in Theory of Computation Definition and Meaning of Regular Language TOC
00:10:18

Regular language in Theory of Computation Definition and Meaning of Regular Language TOC
Operations on Regular language in Theory of Computation Union Concatenation Star Operation
00:08:16

Operations on Regular language in Theory of Computation Union Concatenation Star Operation
Examples of regular language in Theory of computation Rules of Regular Language TOC
00:17:29

Examples of regular language in Theory of computation Rules of Regular Language TOC
Examples of Regular Language in Theory of Computation Rules of Regular Language TOC
00:15:07

Examples of Regular Language in Theory of Computation Rules of Regular Language TOC
Finite Automata definition Important Terminologies of Finite Automata Theory of Computation TOC
00:11:11

Finite Automata definition Important Terminologies of Finite Automata Theory of Computation TOC
Finite Automata Examples in Theory of Computations Examples of DFA NFA DFA NFA
00:14:52

Finite Automata Examples in Theory of Computations Examples of DFA NFA DFA NFA
Non Deterministic Finite Automata NFA TOC Examples of Non Deterministic Finite Automata NFA
00:14:38

Non Deterministic Finite Automata NFA TOC Examples of Non Deterministic Finite Automata NFA
DFA Examples 1 Theory of Computation Dead State in Finite Automata Deterministic Finite Automata
00:18:31

DFA Examples 1 Theory of Computation Dead State in Finite Automata Deterministic Finite Automata
DFA Examples 2 Theory of Computation Dead State in Finite Automata Deterministic Finite Automata
00:16:50

DFA Examples 2 Theory of Computation Dead State in Finite Automata Deterministic Finite Automata
DFA Examples 3 Theory of Computation Dead State in Finite Automata Language accepted by DFA
00:07:37

DFA Examples 3 Theory of Computation Dead State in Finite Automata Language accepted by DFA
DFA Examples 4 Dead State in Finite Automata Atleast constraint in DFA Atmost Constraints in DFA
00:14:57

DFA Examples 4 Dead State in Finite Automata Atleast constraint in DFA Atmost Constraints in DFA
Non Deterministic Finite Automata Theory Example 1 Multiple Transition Path in NFA TOC
00:16:44

Non Deterministic Finite Automata Theory Example 1 Multiple Transition Path in NFA TOC
NFA Examples 2 Theory of Computation Validation check of NFA NFA Example with substring TOC
00:12:22

NFA Examples 2 Theory of Computation Validation check of NFA NFA Example with substring TOC
NFA Example 3 Theory of Computation Validation check of NFA Accepting State in NFA TOC
00:08:16

NFA Example 3 Theory of Computation Validation check of NFA Accepting State in NFA TOC
NFA Examples 4 Theory of computation NFA accepting words NFA non accepting words TOC
00:11:48

NFA Examples 4 Theory of computation NFA accepting words NFA non accepting words TOC
NFA to DFA Conversion Theory of Computation Algorithm to convert NFA to DFA Equivalency NFA DFA
00:12:31

NFA to DFA Conversion Theory of Computation Algorithm to convert NFA to DFA Equivalency NFA DFA
NFA to DFA Conversion Examples Theory of Computation Subset construction method TOC
00:13:31

NFA to DFA Conversion Examples Theory of Computation Subset construction method TOC
NFA to DFA Conversion Examples 2 Language identified by NFA DFA NFA to DFA from transition table
00:09:19

NFA to DFA Conversion Examples 2 Language identified by NFA DFA NFA to DFA from transition table
NFA to DFA Conversion Example 3 Minimization of DFA Non Reachable State Power Set Construction
00:10:32

NFA to DFA Conversion Example 3 Minimization of DFA Non Reachable State Power Set Construction
Minimization of Deterministic Finite Automata Theory of Computation Speed up the execution of DFA
00:11:22

Minimization of Deterministic Finite Automata Theory of Computation Speed up the execution of DFA
Minimization of DFA Triangulation method State reduction Non Reachable state Merging states DFA
00:15:42

Minimization of DFA Triangulation method State reduction Non Reachable state Merging states DFA
Minimization of DFA Example 1 Theory of Computation State Reduction of DFA DFA
00:13:15

Minimization of DFA Example 1 Theory of Computation State Reduction of DFA DFA
Minimization of DFA Example State Reduction of DFA MFA Theory of Computation DFA
00:12:59

Minimization of DFA Example State Reduction of DFA MFA Theory of Computation DFA
Minimization of DFA with multiple final states Theory of Computation State Reduction of DFA DFA
00:11:41

Minimization of DFA with multiple final states Theory of Computation State Reduction of DFA DFA
Minimization of DFA Partition Method –Theory Of Computation State Reduction of DFA DFA
00:10:01

Minimization of DFA Partition Method –Theory Of Computation State Reduction of DFA DFA
Minimization of DFA with Multiple Final States Triangulation Method Myhill Nerod Theoram DFA
00:10:24

Minimization of DFA with Multiple Final States Triangulation Method Myhill Nerod Theoram DFA
Minimization of DFA Non Reachable state Partition Method State Reduction of DFA DFA
00:09:15

Minimization of DFA Non Reachable state Partition Method State Reduction of DFA DFA
Minimization of DFA Non reachable Region Theory of Computation State Reduction of DFA DFA
00:12:08

Minimization of DFA Non reachable Region Theory of Computation State Reduction of DFA DFA
Finite Automata with Output – Mealy Moore Machine Theory of Computation
00:09:40

Finite Automata with Output – Mealy Moore Machine Theory of Computation
Finite Automata with output Moore Machine Theory of Computation
00:07:51

Finite Automata with output Moore Machine Theory of Computation
Finite Automata with Output – Mealy Machine Examples 1 Theory of Computatio
00:09:35

Finite Automata with Output – Mealy Machine Examples 1 Theory of Computatio
Finite Automata with Output – Mealy Machine Examples 2 Theory of Computation
00:11:44

Finite Automata with Output – Mealy Machine Examples 2 Theory of Computation
Finite Automata with Output – Mealy Machine Examples 3 Theory of Computation
00:12:48

Finite Automata with Output – Mealy Machine Examples 3 Theory of Computation
Finite Automata with Output – Moore Machine Examples 1 Theory of Computation
00:11:17

Finite Automata with Output – Moore Machine Examples 1 Theory of Computation
Finite Automata with Output – Moore Machine Examples 2 Theory of Computation
00:09:22

Finite Automata with Output – Moore Machine Examples 2 Theory of Computation
Finite Automata with Output – Moore Machine Examples 3 Theory of Computation
00:08:24

Finite Automata with Output – Moore Machine Examples 3 Theory of Computation
Show More Lessons

Comments

Our New Certified Courses Will Reach You in Our Telegram Channel
Join Our Telegram Channels to Get Best Free Courses

Join Now

We Appreciate Your Feedback

Excellent
2 Reviews
Good
0 Reviews
medium
0 Reviews
Acceptable
0 Reviews
Not Good
0 Reviews
4.6
84 Reviews
K.sai nandini

good 2025-09-14

B.Nandini

good 2025-09-13

VENKATESWARI KOTAKONDA

I thoroughly enjoyed this course and found it incredibly valuable. The content was well-structured, easy to follow, and covered all the essential topics within the 15-hour duration. The instructors were knowledgeable and supportive, and the learning materials were practical and engaging. I feel more confident in applying what I’ve learned and would definitely recommend this course to others looking to enhance their skills. 2025-09-11

Kompally Shalini

good 2025-06-16

DOOTA SARA

good course 2025-06-11

VISHAAL R R

HELPFUL COURCE 2025-05-28

Vaishnavi Ezhumalai

very nice 2025-05-21

Niveditha KU

it was very good course 2025-05-17

Jahnavi Mutthunuri

very nice lecture thankyou 2025-05-16

Pragathi Thallapally

i loved this 2025-05-14

Mekala sindhuja

really good 2025-05-14

Poorvaj B V

lol 2025-05-09

Show More Reviews


Related Courses in Mathematics
Real numbers
11 Lessons

Real numbers

Statistics
14 Lessons

Statistics

Quadratic Equation
12 Lessons

Quadratic Equation

Polynomials
11 Lessons

Polynomials

Pair of Linear Equations in Two Variables
14 Lessons

Pair of Linear Equations in Two Variables

Coordinate Geometry
11 Lessons

Coordinate Geometry

Arithmetic Progression
11 Lessons

Arithmetic Progression

Areas Related to Circles
12 Lessons

Areas Related to Circles

Circles
14 Lessons

Circles

Application of Trigonometry
11 Lessons

Application of Trigonometry

Triangles
19 Lessons

Triangles

Surface Area and Volumes
22 Lessons

Surface Area and Volumes

Youth Empowerment
12 Lessons

Youth Empowerment

Algebra Full data
36 Lessons

Algebra Full data

Algebra
30 Lessons

Algebra

Discrete Mathematics
26 Lessons

Discrete Mathematics

Course Description

Theory of Computation course in hindi, in this course Explore the theoretical foundations of computation, automata, languages, and complexity in this comprehensive course.
Trends
Recent
Previous Lesson Next Lesson