00:01
Hello students, to implement the tetramystic finite automata that is dfa for the regular expression of a, a plus t, t and a, a plus t, t all in a c hash.
00:24
So we need to first follow the steps is first we need to define the dfa states, define the dfa states, so where you need to define the states of the dfa each state represents the specific pattern that the input dna sequence should matches.
00:47
So implementing the dfa transition function, so next is you need to implement after defining you need to just implement the dfa transition, dfa transition.
01:01
So here in the implementing based on the current state and the characters as the characters as a, t, g or c determines the next state handle or it determines the next states.
01:22
So next is the handling it is the handling accepting state, handling accepting states, handling accepting states, define the accepting states where the dfa considers the input sequence as the match for the regular expression.
01:43
So after that you need to read the input dna sequence, input dna sequence, so where as the users to put a dna sequence.
01:58
So after that processing the input dna using the dfa, so process the dna, process the dna, dna using the using the dfa, using the dfa.
02:16
So here you just read the dna sequence character and perform the state transition and checks if the state final state is accepting or not.
02:27
The later it is the output, output that is the result, output result as display as it displays whether the input dna is valid according it valid according to the regular expression or not...