The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
46 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.1k points)
edited by | 46 views

1 Answer

+1 vote
Best answer
S -> AB

A ->aAC | C

C -> bC | b

B -> aBbb | $\varepsilon$
answered by Active (4.1k points)
selected by


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

37,963 questions
45,466 answers
131,323 comments
48,379 users