Solution

The correct answer is (A) and (C) Only

EXPLANATION:

• (A) All production rules are of the form A → xB or A → x, where A and B are non terminal symbols and x is a terminal symbol. -
  • This statement is CORRECT. This is the definition of a regular grammar. In regular grammars, production rules are restricted to these forms to ensure that the language generated is regular.
• (B) Regular grammars are more powerful than context-free grammars and can express any type of language. -
  • This statement is NOT CORRECT. Regular grammars are actually less powerful than context-free grammars. Regular grammars can only describe regular languages, which are a subset of context-free languages.
• (C) There is a direct correspondence between regular grammar and finite automata. -
  • This statement is CORRECT. For every regular grammar, there exists an equivalent finite automaton and vice versa. This correspondence is a fundamental concept in the theory of computation.
• (D) Regular grammars can generate languages that are not recognised by any type of automata. -
  • This statement is NOT CORRECT. Regular grammars can only generate regular languages, which are precisely the languages recognized by finite automata.