The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 votes

Find the grammar that generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In that grammar what is the length of the derivation (number of steps starring from $S$) to generate the string $a^{l}b^{m}$ with $l\neq m$

  1. $max (l,m) + 2$
  2. $l + m + 2$
  3. $l + m + 3$
  4. $max (l,m) + 3$
asked in Compiler Design by Veteran (97.7k points) | 496 views

@jothee answer and quetion already here.

2 Answers

0 votes
Part A
answered by (23 points)
0 votes
answered by Loyal (7.1k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,814 questions
54,522 answers
75,380 users