logic - Direct Reduction, Turing machine and a DFA -
i have been reading , trying understand reduction when comes truing machine. how understand it: means reduces problem problem c. not quite sure how totally works. lets see example:
given language l:
l ={<m,d>| m s tm , d dfa l(m) = l(d)}, using reduction how prove atm < l.
my solution:
m turing machine accepts string , halts on string. d dfa hast accepts language l , equivalent tm m. atm tm, m accepts string w.
how can prove using direct reduction atm < l??
Comments
Post a Comment