Question

consider the language L = { a^m b^n : m>2n}, give context free grammar and Nondeteministc pUSH DOWN AUTOMATON

Answer 1

a^mbⁿ consist of language a followed by b,where number of a is greater than double of b

here forms a sample string: { ^, a, aa, aab, aaaab, aaaaabb.......}

S-> B      |^

B-> aBb | A

A->a A    | a

The program can be written as L = { a^m b^n : m>2n}

S-> aSb |A

A->aA    |^