Answer:
Following are the solution to the given question:
Explanation:
When a finite computation c has n conditions in c this is not possible to obtain a string with such a minimum of n-1 letters or nation. Guess 1 wants to check whether
[tex]L(C)= \Sigma \times \ if \ C[/tex]
is dissuasive, then all the states reachable should agree. This could be tested if all sentences up to n-1 are in the language.
