GATEverse
← GATE CSE 2001

Q6

NATMarks unknown

Give a deterministic PDA for the language L={ancb2n∣n≥1}L=\{a^ncb^{2n} \mid n \geq 1\} over the alphabet Σ={a,b,c}\Sigma = \{a,b,c\}. Specify the acceptance state.

Sign in to save attempts.

Loading…