Hi, Thanks for this lecture series. It's clear my concepts. There is something wrong in example 2. Please check it. The DFA doesn't fulfill conditions for 1010.
I think the question is wrong bcoz , it says " accept the string which starts with 1 and ends with 0 ". suppose a string start with 0 or 0's , it will not accepted no matter if you put it in a dead state or the string ends with 0. There were two conditions " starts with 1 and ends with 0 " so, if the first condition is not matching or true then how will the string is accept ? if the question says " starts with 1 or ends with 0 " then there will be a dead state. (If I am wrong please correct me).
It's not complete answer ig... What if we take a qt state ( dead state ) on 0 input from q0...then self loop qt state..... to disable the strings that start with 0....
example 2 dfa drawn is wrong, there should be a dead state going from q0 and further there should be a loop of 0,1 on that dead state, such that there is no acceptance of strings starting from 0
Hi, Thanks for this lecture series. It's clear my concepts. There is something wrong in example 2. Please check it. The DFA doesn't fulfill conditions for 1010.
I think the question is wrong bcoz , it says " accept the string which starts with 1 and ends with 0 ". suppose a string start with 0 or 0's , it will not accepted no matter if you put it in a dead state or the string ends with 0. There were two conditions " starts with 1 and ends with 0 " so, if the first condition is not matching or true then how will the string is accept ? if the question says " starts with 1 or ends with 0 " then there will be a dead state. (If I am wrong please correct me).
Why you don't draw "0" input at q0 state? i think each state goes to exactly 2 states with 2 different inputs
medam i can't understand 1010
mam 2nd string you passed 1010 is incorrect
you were explaining great but at the 1010 step you explained it wrong
It's not complete answer ig... What if we take a qt state ( dead state ) on 0 input from q0...then self loop qt state..... to disable the strings that start with 0....
This is not complete dfa because initial state doesn't have 0 input, it doesn't satisfy dfa rule
example 2 dfa drawn is wrong, there should be a dead state going from q0 and further there should be a loop of 0,1 on that dead state, such that there is no acceptance of strings starting from 0
Q0 zero input is missing give that to dead state
Mam, Aapne q0 👉0 keliye dead state hi nahi banaya
Sorry Mam
Hi madam in dfa all input symbols transitions should be there but intial state have transition for input 1 is there don't have transition for input 0
in the example 2 you put the string 1010 ......??? how to accepted the string???
how to make the table at
You have catched my exact problem thank you madam for the great help, it really means alot for me
Thank u madam u have helped a lot... U explained with clarity.... Thank u so much...
Thanku mam , I totally understand it ,this topic has recently started in our college and i didnt understand at that time but i now understand 😊
if we input 0 ,then what will happen?....so,there will be one trap state.
hlo mam what about the '0'variable for q0 in example 2