×
Create CV Books Summaries Online Courses Blog Communities

Login

Sign up
MindLuster Logo
Categories
Recent

Theory of Computation

Mathematics

Register in this Course

Theory of Computation by Engineering Funda

Introduction to Theory of Computation Need of Theory of Computation Target Audience of TOC

Why study theory of Computation Theory of Computation TOC

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Minimization of DFA Non reachable Region Theory of Computation State Reduction of DFA DFA

Finite Automata with Output – Mealy Moore Machine Theory of Computation

Finite Automata with output Moore Machine Theory of Computation

Finite Automata with Output – Mealy Machine Examples 1 Theory of Computatio

Finite Automata with Output – Mealy Machine Examples 2 Theory of Computation

Finite Automata with Output – Mealy Machine Examples 3 Theory of Computation

Finite Automata with Output – Moore Machine Examples 1 Theory of Computation

Finite Automata with Output – Moore Machine Examples 2 Theory of Computation

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

Moore to Mealy conversion Why do we need conversion from Mealy to Moore Machine

Examples of Moore to Mealy conversion Theory of Computation MooreMachine MealyMachine

Mealy machine to Moore machine conversion Examples 1 MooreMachine MealyMachine

Mealy machine to Moore Machine conversion Examples 2 MooreMachine MealyMachine

Mealy machine to Moore machine conversion Examples 3 MooreMachine MealyMachine

Finite Automata with NULL € Transition in Theory of Computation FiniteAutomata NullTransition

€ closure of NULL transition of all states in NFA EpsilonClosure NullTransition NFA

NFA € to NFA Conversion in Theory of Computation NFA NFAEpsilon

NFA € NFA NULL to NFA conversion in Theory of Computation NFA NFAEpsilon

NFA € NFA NULL to DFA Conversion in Theory of Computation NFA NFAEpsilon DFA

Regular Expression Theory in Theory of Computation RegularExpression

Regular Expression Definition Example in Theory of Computation RegularExpression

Identities of Regular Expression in Theory of Computation RegularExpression

Regular Expression Example in Theory of Computation RegularExpression

NFA DFA to RE NFA DFA to Regular Expression conversion in Theory of Computation NFA DFA RE

FA to RE Arden s Theorem Finite Automata to Regular Expression Conversion using Arden s Theorem

Arden s Theorem Example 1 NFA to RE conversion Using Arden s Theorem ArdensTheorem

Arden s Theorem Example 2 FA to RE Conversion Using Arden s Theorem ArdensTheorem

FA to RE Conversion State Elimination Method FiniteAutomata RegularExpression

FA to RE Conversion State Elimination Method Example in Theory of Computation FA RE

Regular Expression to Finite Automata Conversion RE to FA Conversion in Theory of Computation

RE to FA Examples Regular Expression to Finite Automata Examples in Theory of Computation

Non Regular language Pumping Lemma to prove a language to be Non Regular

Pumping lemma Example in Theory of Computation PumpingLemma

Grammar Types Different types of Grammar definition in Theory of Computation

Pumping Lemma Example 2 in Theory of Computation PumpingLemma

Grammar Production Rules Production rules of different types of grammars in Theory of Computation

Examples of grammar and String belonginess to the language accepted by grammar

Ambiguous Grammar Definition of Ambiguous Grammar Examples of Ambiguous Grammar

Linear grammar Definition Example of Linear Grammar Right Left Linear Grammar

Derivation Tree Definition of Derivation Tree Types of Derivation tree Example of Derivation Tree

Context Free Grammar in Theory of Computation CFG ContextFreeGrammar

CFG Example 1 Example of Context Free Grammar in Theory of Computation CFG ContextFreeGrammar

Normal Form in Theory of computation NormalForm ContextFreeGrammar

Useless Production in Theory of computation

Removing Useless Production in Theory of computation

CFG Example 2 Example of Context Free Grammar in Theory of Computation CFG ContextFreeGrammar

CFG Example 3 Example of Context Free Grammar in Theory of Computation CFG ContextFreeGrammar

Useless Production – Non deriving String NormalForm ContextFreeGrammar UselessProduction

Removing Null Production NormalForm ContextFreeGrammar NullProduction UselessProduction

Identifying Unit Production and Removing Unit Production from CGF in Theory of computation

Chomsky Normal Form in Theory of Computation ChomskyNormalForm

Pushdown Automata PDA in Theory of computation

Pushdown Automata Example in Theory of computation

We Appreciate Your Feedback

Excellent
103 Reviews
Good
59 Reviews
medium
4 Reviews
Acceptable
0 Reviews
Not Good
3 Reviews
4.5
169 Reviews
A RAKESH 

GOOD
2026-04-16

Naga Dilip 

good
2026-04-16

shobha reddy 

great learning experience
2026-04-12

Shekar K 

Good
2026-04-11

ADITYA TUKARAM VANJARI 

its good
2026-04-11

Vijay R 

feef
2026-04-09

Shivakumar Maranabasari 

Good
2026-04-08

Raghavendra prasanna Rg 

.
2026-04-08

YASHWANTH 

nice
2026-04-07

Yashas Reddy 

good course
2026-04-07

Sai Sahas K b 

nice
2026-04-07

shivangouda mattur 

good
2026-04-07

Show More Reviews

Another Mathematics Courses

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

Show More Course for Mathematics

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
Real numbers