Minimising DFSM | ATC |18cs54 | Module 1 | VTU | Model QP solved

preview_player
Показать описание
Its a longer video and you can skip to the end of video for solution.
Other related links :

  1. Master Computer Science Subjects
  2. atc
  3. automata theory and computability vtu
  4. minimizing dfa
  5. minimal dfa examples
  6. minimal dfa questions
Рекомендации по теме
Minimising DFSM | 0:19:12

Minimising DFSM | ATC |18cs54 | Module 1 | VTU | Model QP solved

Minimize the DFA 0:22:24

Minimize the DFA using table filling algorithm|Lec-12|ATC VTU syllabus module - 1,myhill nerode meth

Minimization of DFA 0:11:38

Minimization of DFA | ATC | 18cs54 | VTU | Model QP solved

Minimization of DFA 0:15:56

Minimization of DFA (Example 1)

Minimize DFSM/DFA using 0:07:20

Minimize DFSM/DFA using grouping method| Lec-29|ATC VTU syllabus module - 1

Minimization/MOD 1/ ATC 0:18:35

Minimization/MOD 1/ ATC 18CS54

08 ATC Module 0:22:50

08 ATC Module 1 Minimization of DFSM

ATC- Module1- Lecture 0:26:34

ATC- Module1- Lecture 7 - Minimizing the existing DFSM

18CS54 - ATC 0:55:31

18CS54 - ATC - MODULE 1 - Automata and Theory of Computation - VTU 5th SEM CSE

Automata Theory |TABLE 0:14:43

Automata Theory |TABLE FILLING ALGORITHM- Minimization of DFA| Problem 1 | ATCD-21CS51

Minimising an Existing 0:29:09

Minimising an Existing DFSM | Lecture-14

Minimize DFSM/DFA using 0:09:22

Minimize DFSM/DFA using grouping method|lec-30|ATC VTU syllabus module -2

Minimization of dfa(ToC 0:22:11

Minimization of dfa(ToC ,ATC)

construction of DFSM 0:24:28

construction of DFSM |18cs54 | ATC

DFSM problem | 0:09:44

DFSM problem | Module 1|Automata theory and Compatibility |

18CS54 Automata Repeated 0:09:41

18CS54 Automata Repeated Questions and Solutions | Pass Package 🍰 | VTU 5th SEM CSE/ISE

DFSM to accept 0:17:40

DFSM to accept strings ending with abb | 18cs54 |atc

18CS54-Automata: Reference Video 4:04:02

18CS54-Automata: Reference Video for Externals

Introduction of DFSM 0:21:51

Introduction of DFSM | 18CS54 | ATC

Theory of computation 0:10:16

Theory of computation : minimization of DFA

Simulators for FSM, 0:46:40

Simulators for FSM, minimizing dfsm_VTU_JNNCE CSE ATC SNN M1-C10

18CS54| M1| PART 0:16:36

18CS54| M1| PART 5| CONVERSION FROM NDFSM TO DFSM

Minimize the DFA 0:39:00

Minimize the DFA using table filling algorithm|equivalence of states|Lec-24| VTU syllabus module - 2

AUTOMATA THEORY AND 0:33:38

AUTOMATA THEORY AND COMPUTABILITY- DFSM problem

Комментарии
Автор

Awesome teaching maam. Please do post answers for all the questions of model question paper that would be a great help☺

pratikshashetty
Автор

Thanks Ma'am it's a help at right time.

jcsgs
Автор

great help mam..please post all the answer of module paper.

Haiderali-hicj
Автор

Watching at 2x speed before the exam ⚡

raashid
Автор

I guess we have to remove unreachable state first, right!?

I think here 'd' is an unreachable state so we have to remove it first and then we have to minimize the DFA!!

siddharthmishra
Автор

If start and the final state is on same state (say, q0) how to solve ma'am .In which set we should consider q0 ?

bharathigowda
Автор

Could u please post the solutions of exam paper solutions of ATC for 2018 scheme

keerthansreddy
Автор

Dear Students, in the above solved problem, D is an unreachable state as it has no incoming transitions at all..so while solving the problem, we must remove the state.
The method I solved it remains the same. But I must have excluded the state 'D'.

Regret for this mistake. You people please solve this problem without D and post the answers. Tq @Siddhart mishra

mastercomputersciencesubje