1,221 views
1 1 vote
Find the language generated by grammar ,where S and A are non terminals and 0 is terminal

S->0A

A->0 | SS

1 Answer

Position:
Show:

Related questions

2 2 votes
1 answers 1 answer
902
902 views
Debargha Mitra Roy asked Jul 30, 2024
902 views
Find the minimum string generated by the below Regular Expression.$\left(\left(ab\right)^*a^+\right)^+bb^+aa^*$$\left(\left(ab\right)^+aba\right)^+aaa$$\left(aaa^*aba^*\r...
1 1 vote
1 1 answer
928
928 views
KISHALAY DAS asked Nov 14, 2016
928 views
0 0 votes
1 answers 1 answer
852
852 views
set2018 asked Dec 10, 2017
852 views
Which of the following language generated by given grammar?1) L = {w : na(w) and nb(w) both are even}2) L = {w : na(w) and nb(w) both are odd}3) L = {w : na(w) or nb(w) a...
0 0 votes
1 1 answer
985
985 views
Ashwani Kumar 2 asked May 7, 2016
985 views
S- +SS | -SS | aGive explanation?