BCS503 Theory of computation (TOC) Module 1. (part 1) VTU. 5th sem

00:00 Introduction to theory of automation
02:15 Alphabet,String, language,problem
06:30 introduction to DFA
11:06 introduction to NFA,ENFA,Eclousre
14:10 DFA to construct atleast 1 a,2a
24:00 DFA to construct exactly 1a,2a
30:00 DFA to construct atmost 1a, 2a
33:00 language type DFA
40:55 even number of DFA,odd number DFA
43:55 DFA starting from a,abb,type pblm
47:20 DFA ending with a,ab,type pblm
57:37 DFA to accept substing type pblm
1:10:00 Divisible by K problem of DFA

Google drive link for notes:-

Stay connected through telegram channel:-

#IntroductiontoFiniteAutomata, #StructuralRepresentations, #AutomataandComplexity. #TheCentral ConceptsofAutomataTheory. #DeterministicFiniteAutomata, #NondeterministicFiniteAutomata,
#An Application:TextSearch,FiniteAutomata withEpsilon-Transitions.

[computer_tech]

thank you
now i understood the DFA concept 🥳.
do this type content we will support you 👍

[Mahii_monster-po]

Your voice and teaching is just awesome 😮❤

[cacreations]

Very Helpful, Thanks for ur Teaching 😍

[MadMaxStudiO]

51:36 ends with b yaa? alla end with ab.... 💥

[yanams]

ma'am could you please list the TYPES of problems that come in each module for vtu exam? there are so many variations and types im so confused

[uppi]

mam please share part 2 my friends r all studying through ur videos

[jonathanfanclub]

Vtu 5th sem 2022 scheme full covered??

[SANJAY-nu]

Mam last question 10 mod 1, 20 mod 1 hege bantu

[cacreations]

Very Helpful, Thanks for ur Teaching 😍