0 votes
1
What is the union of recursive and recursive enumerable language?
0 votes
2
Consider the grammar:S->aSbS/ bSaS/ ε,The smallest string for which the grammar has two derivation trees:ababaabbbbaaaaabbband how?