![]() |
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...
|
| All times are GMT -4. The time now is 12:54 AM. |
Powered by vBulletin®
Copyright ©2000 - 2026, Jelsoft Enterprises Ltd.