1,851 views

1 Answer

1 1 vote

..............

Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
2.3k
2.3k views
aditi19 asked Mar 7, 2019
2,288 views
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?
3 3 votes
2 2 answers
168
168 views
GO Classes asked Sep 1
168 views
Consider the CFG$$\begin{aligned}S &\to VS \mid cT \\T &\to VT \mid cU \\U &\to \epsilon \mid VU \\V &\to a \mid b\end{aligned} $$Which language is generated by this gram...
0 0 votes
0 0 answers
397
397 views
1 1 vote
2 2 answers
2.1k
2.1k views
vishal8492 asked Dec 6, 2016
2,130 views
So , 1 is mandatory in Regular expression ; and both of above grammar allows strings without 1 to be genearated.So , I expected None of above to be answer. What Am I mis...