creating a context free grammar ?
give a context free grammar for the following language over the alphabet {0,1,#} L = { x#y | x,y ? {0,1}* and x ? y } HINT: Under what conditions are the two strings different whose lengths are different? Under what conditions are two strings different whose length are the same ? I have...
__________________
Website Development
Domain Name Forum
|