module 1| Minimized finite automata | check description for the steps to solve

most important question

minimized finite automata using the table

steps :-

1. write all states , ABCDEFGH

2. separate the final state and other states
ABCEFGH | D

3. separate the states connected to final state (D)
ABFG | H | CE | D

4. next separate the remaining state connected to other already separated states
AG | BF | H | CE | D

now you get the states

by taking the help of the table locate the next states ...

example:
A and G -------goes to ------ B and F (correspondingly)
similarly locate all

if not understood, copy these steps and take a screenshot of this video and PASTE it in CHATGPT
all the best 🎉

comment for required cheatsheet 📨
#toc #dfa #allquestions #importantquestions #importantquestions
#quicktips #revision #cheatsheet

Видео module 1| Minimized finite automata | check description for the steps to solve канала TeenTechie