edited by
609 views
0 votes
0 votes

what is the answer

edited by

1 Answer

Related questions

0 votes
0 votes
2 answers
1
suneetha asked Dec 22, 2018
328 views
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
0 votes
0 votes
1 answer
2
suneetha asked Dec 22, 2018
519 views
G1: S-→ aSa| bSb|eG2:S → aaS|bbS| ethe shortest length strings which does not belongs to L(g1) but belongs to L(G2) is
1 votes
1 votes
0 answers
3
0 votes
0 votes
1 answer
4
ARUN KUMAR 3 asked Oct 12, 2016
532 views
If a parse tree is made for a w ε L(G), when G is in Chomsky-Normal form then what would be it's least height?? Plz explain what and how...