Consider the following statements:
I) Type-0 grammar generate exactly all language that can be accepted by a total Turing machine.
II) Type-1 grammars generate exactly all languages that can be recognized by a liner bounded automaton.
III) Type-3 grammars have one to one correspondence with set of all regular expressions.
Which of the above statements is/are TRUE?1
I only
2
I and III only
3
III only
4
II and III only
5
Question Not Attempted