Question 48 Which of the following statements is false? A Every NFA can be converted to an equivalent DFA B Every non-deterministic Turing machine can be […]
Question 50 Which of the following statements are true? I. Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa II. All \epsilon productions […]