The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
62 views
L1={$a^nb^m$:n>=0,m>n}

L2={$a^nb^{2n}$:n>=0}

find the grammar for L1L2
asked in Theory of Computation by Active (4.2k points)
edited by | 62 views

1 Answer

+1 vote
Best answer
S -> AB

A ->aAC | C

C -> bC | b

B -> aBbb | $\varepsilon$
answered by Active (4.2k points)
selected by
0
Thank you

Related questions

0 votes
1 answer
5


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

46,761 questions
51,218 answers
176,454 comments
66,578 users