Question

Difference between context free and context sensitive grammer in automata

Answer 1

A context-free grammar (CFG) is a grammar where (as you noted) each production has the form A → w, where A is a nonterminal and w is a string of terminals and nonterminals. ... For the context-sensitive grammars, the automaton you would use is called a linear bounded automaton (LBA).

Answer 2

Answer:

It is the context free and the sensitive grammar in the automata...