Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata

Consider the following pushdown automata P,

and also consider following grammars

1. A → AaAaA | bA | ϵ 

2. A → AaAbA | AbAaA | ϵ 

3. A → aAa | bAb | aAb | bAa | ϵ 

4. A → aAa | bAb | ϵ 

5. A → aAa | bAb | a | b | ϵ 

How many grammars given above generate exactly the same language accepted by the P?

Enter numerical value using the virtual keypad. Round off where necessary.

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters