Timeline for Determine whether two languages are context free
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
Sep 23, 2013 at 20:56 | comment | added | user678392 | Fair enough. I want to be able to see why the grammar is the way it is. | |
Sep 23, 2013 at 18:04 | comment | added | Gilles 'SO- stop being evil' | @user678392 That's the usual definition of context-free: a language is context-free if there is a context-free grammar that recognizes it. | |
Sep 23, 2013 at 16:01 | comment | added | user678392 | Well, I'm stuck because I don't see how it is an answer. The answer seems to be: hey, here's a grammar that generates what we want. So it's context-free. | |
Sep 22, 2013 at 23:28 | comment | added | Gilles 'SO- stop being evil' | @user678392 $L_1$ is an easy exercise, you've had everything handed to you. $L_2$ is a difficult exercise, if you have tried for yourself and don't understand the solution, feel free to ask a new question where you tell us how far you got and where you're stuck. | |
Sep 22, 2013 at 23:25 | comment | added | user678392 | you do realize that the solution you linked to is horrendous to understand. | |
Sep 22, 2013 at 23:20 | comment | added | user678392 | Given that I don't understand the explanation or are confused by it, I would beg to differ. | |
Sep 22, 2013 at 23:11 | comment | added | Gilles 'SO- stop being evil' | @user678392 My intuitive explanation pretty much tells you how to construct a PDA. I've done about 90% of your homework exercise here, you should at least do the final step by yourself. | |
Sep 22, 2013 at 23:03 | comment | added | user678392 | how does this translate into a pda? Can you reword your explanation on L_1. Also, how does the pda work if j = 0 or i,j = 0? | |
Sep 22, 2013 at 23:02 | history | answered | Gilles 'SO- stop being evil' | CC BY-SA 3.0 |