Language produced by CFG

Shweta Singh Lodhi asked Oct 5, 2016 • retagged Jul 4, 2017 by Arjun

420 views

1 votes

Consider the context free grammar below. What language does it generates?

S -> 0B|1A

A ->0|0S|1AA

B ->1|1S|0BB

Theory of Computation
context-free-grammar
context-free-language
ldentify-language
theory-of-computation

+ –

Shweta Singh Lodhi asked Oct 5, 2016 • retagged Jul 4, 2017 by Arjun

Shweta Singh Lodhi

420 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Best answer

3 votes

language generated by this grammer contains equal number of 0's ans 1's

(01,10,1100,1010,0101,0110,....)

. answered Oct 5, 2016 • selected Oct 19, 2016 by Shweta Singh Lodhi

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

2 answers

Shefali asked Oct 22, 2015

2,273 views

Identify language generated by CFG
Consider the following grammar, $S\rightarrow aSa|bSb|A$ $A\rightarrow aBb$ $B\rightarrow aB|bB|\epsilon$ Identify the language generated by above CFG a. $L=\left\{ww^R \;|\; w\in (a+b)^* \right\}$ b. $L=\left\{xwabbw^R \;|\; w,x\in (a+b)^* \right\}$ c. $L=\left\{waxbw^R \;|\; w,x\in (a+b)^* \right\}$ d. None of these

Consider the following grammar,$S\rightarrow aSa|bSb|A$$A\rightarrow aBb$$B\rightarrow aB|bB|\epsilon$Identify the language generated by above CFGa. $L=\left\{ww^R \;|\; ...

Shefali

2.3k views

Shefali asked Oct 22, 2015

Theory of Computation
theory-of-computation
ldentify-language

+ –

11 votes

1 answer

Tushar Shinde asked Jan 12, 2016

2,794 views

Identify language
Consider the sets over $\left\{a,b\right\}$ $S_1=\left\{a,ab\right\};$ $S_2=\left\{b,ba\right\};$ $S_3=\left\{a^nb^{2n}\right\}\cup \left\{a^{2n}b^n\right\};$ $S_4=\left\{ww^R|w\in(a,b)^*\right\};$ ... prefix property. But, why cant they be accepted by dfa (where we dont check prefix property satisfaction). If pda was given then they would have been right, I guess.

Consider the sets over $\left\{a,b\right\}$$S_1=\left\{a,ab\right\};$$S_2=\left\{b,ba\right\};$$S_3=\left\{a^nb^{2n}\right\}\cup \left\{a^{2n}b^n\right\};$$S_4=\left\{ww^...

Tushar Shinde

2.8k views

Tushar Shinde asked Jan 12, 2016

Theory of Computation
identify-class-language
finite-automata
theory-of-computation
ldentify-language

+ –

0 votes

0 answers

jaisyking asked Jan 12, 2023

196 views

Context Free Languages(CFG) Push Down Anutomata(PDA)
PDA for $a^i b^j | i \neq 2j+1$ ?

PDA for $a^i b^j | i \neq 2j+1$ ?

jaisyking

196 views

jaisyking asked Jan 12, 2023

Theory of Computation
theory-of-computation
context-free-grammar
pushdown-automata
context-free-language

+ –

1 votes

1 answer

aditi19 asked Mar 7, 2019

863 views

CFG Doubt
what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in w how to approach this?

what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in whow to approach this?

aditi19

863 views

aditi19 asked Mar 7, 2019

Theory of Computation
context-free-language
theory-of-computation
context-free-grammar

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0