Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars

The language generated by the following Grammar G:

A -> aA₁bA₂c | aA₃bA₄c

A₁-> aA₁b | ∈

A₂ -> A₂c | ∈

A₃ -> A₃a | ∈
A₄ -> bA₄c | ∈

1

{ a^pb^qc^r | p>q or q=r}

2

{ a^pb^qc^r | p=q>=r}

3

{ a^pb^qc^r | p,q,r>=0}

4

{ a^pb^qc^r | p=q or q=r}

Sponsored

hivanix.in

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