Language in Automata Theory: Finite & Infinite 📚

What is language in automata theory | Theory of computation | finite and infinite language

Chapters:-
0:00 Introduction
1:15 Language
2:47 Example
5:47 Complement of language
6:37 Reverse of language
7:27 Concatenation of language
8:33 Finite and infinite language
11:25 Kleene closure ( star closure )
12:48 Positive closure

#1 Theory of computation introduction | Automata theory introduction
https://youtu.be/pvV1pOUjK90

#2 Basic concept of Theory of computation | TOC Basic concpets | Symbol | Aphabet | String | Language
https://youtu.be/9Id6DkI9NcY

#3 What is language in automata theory
https://youtu.be/1GVLhIypH3o

#4 What is Automata
https://youtu.be/bqYq95yKHnI

#5 Grammar in TOC
https://youtu.be/K5LK1xIOZug

#6 Grammar Language and corresponding Automata
https://youtu.be/lt_Ju4xnlko

#7 Finite automata | Classification of automata
https://youtu.be/mBfAhXpm-JU

#8 Deterministic Finite Automata | DFA construction
https://youtu.be/vCwD8JAL1fs

#9 DFA construction for all strings with exactly one a
https://youtu.be/eFum1vPGCrk

#10 DFA construction for all string with atleast one a
https://youtu.be/sCX_bx1SfK8

#11 DFA construction for all string with no more than three a's
https://youtu.be/Uai4Qrj0M9w

#12 DFA design for all string which accept odd number of 1's and any number of 0's
https://youtu.be/XN1cT3IFp1w

#13 DFA design for all string that always ends with 00
https://youtu.be/1BssbkZ86SM

#14 NFA | NDFA | Non deterministic finite automata
https://youtu.be/ER5VFpLwSy0

#15 Difference between DFA and NFA | NFA VS DFA
https://youtu.be/HFDDAS0i2sc

#16 NFA construction | NFA design for all string ends with aa
https://youtu.be/K3KzgS1ucD8

#17 NFA construction | construct nfa for the set of all strings with substring aba
https://youtu.be/pLxTZ3ldqR4

#18 NFA construction for all string whose third symbol from the right end is b | How to construct NFA
https://youtu.be/fOIJZF-_LAk

#19 Epsilon NFA | NFA with epsilon transition | epsilon moves in NFA
https://youtu.be/mio3SS1NdRs

#20 NFA to DFA conversion | Conversion NFA into DFA | How to convert nfa into dfa
https://youtu.be/H3nFLIgEs-U

#21 NFA to DFA conversion for all string in which second last bit is 1 | NFA into DFA conversion
https://youtu.be/WCj4YR6uiuo

#22 epsilon NFA to NFA | eliminate epsilon moves | How to convert epsilon nfa into nfa
https://youtu.be/M3kcOa27Zb0

#23 Minimization of DFA | Minimization of dfa using equivalence classes | set method
https://youtu.be/YTQ1dTIUvng

#24 Minimization of DFA | Minimization of dfa using table filling method | Myhill Nerode Algorithm | TOC
https://youtu.be/7plRQugLxus

#25 Equivalence of DFA | Equivalence of two finite automata
https://youtu.be/VJ142TQoelI

#26 Moore machine Introduction | Transition diagram and Moore table
https://youtu.be/qi2FwRvl2Gg

#27 Construction of Moore machine | How to construct moore machine for string
https://youtu.be/kuNOhtRGIPM

#28 Mealy machine in toc | Mealy machine example
https://youtu.be/OQQP_P_gB6k

#29 Construction of mealy machine | Mealy machine in toc | Theory of computation
https://youtu.be/puuV6-rTKBw

#30 Moore machine to mealy machine conversion | conversion moore machine into mealy machine
https://youtu.be/A6PMIzzRpGg