very very intresting stuff, wish i could just understand this stuff better, really am infatuated with theory of computation, but i feel like im so dumb
In that case, the machine will simply say reject. It will run for a finite amount of time and what is important here is we can give a machine that decides the emptiness of DFA. therefore, it is decidable.
You are great Thank you so much
nicely explained.
could he not simulate this machine on the DFA and if it accepts it works else if it rejects it does not?
Can we use the decider for EQ_DFA on the input , where EMPTY is a DFA that accepts nothing?
thank you
very very intresting stuff, wish i could just understand this stuff better, really am infatuated with theory of computation, but i feel like im so dumb
Thankyou
what if that start state is the final state and also the only state is that state not then reachable?
In that case, the machine will simply say reject. It will run for a finite amount of time and what is important here is we can give a machine that decides the emptiness of DFA. therefore, it is decidable.
If the start state is final, then it is reachable. Hence, L(M) is not empty.
@@lowerbound4803 right
if there is any final state and and there is no path then machine accept language