Question

There are two correct answers...

Incorrect Question 8 0/4 pts In performing the mapping reduction from ATM to RETm, we built a machine M' that took string x as an input. Machine M' was defined in such a way that (pick two answers below) Note: RETm is the set of TM that represent regular languages If M does not accept w, then the language of M' is context-free and equal to {0"1" : n>0} The language of M' is always context-free If M accepts w, then the language of M' is regular, and equals >* The language of M' is always regular

Answer 1

18, In performing the mapping reduction from ATM to REIM, we built a machine M'that took string & as a input. Machine M'defined such a way that * Of M accepts w, then the language Mis regular and equals & * The language of m' is always regular. I option 3 and 4