Timeline for why does ${a^nb^n}$ fit the pumping lemma for context-free languages?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11, 2013 at 21:21 | history | tweeted | twitter.com/#!/StackCompSci/status/388776290821869568 | ||
| S Oct 10, 2013 at 21:30 | history | suggested | Sim | CC BY-SA 3.0 |
added math notation $ to make it readable and changed the title to reflect the actual question
|
| Oct 10, 2013 at 20:33 | vote | accept | user2226106 | ||
| Oct 10, 2013 at 20:26 | vote | accept | user2226106 | ||
| Oct 10, 2013 at 20:26 | |||||
| Oct 10, 2013 at 20:16 | answer | added | user10520 | timeline score: 3 | |
| Oct 10, 2013 at 20:15 | review | First posts | |||
| Oct 13, 2013 at 16:42 | |||||
| Oct 10, 2013 at 20:02 | comment | added | user2226106 | yes I know that but I just wanted to see that this language satisfies the conditions of the pumping lemma. @Sim | |
| Oct 10, 2013 at 20:02 | review | Suggested edits | |||
| S Oct 10, 2013 at 21:30 | |||||
| Oct 10, 2013 at 20:01 | comment | added | Sim | contextfree rule for building this grammar: <S> = a<S>b | |
| Oct 10, 2013 at 19:56 | history | asked | user2226106 | CC BY-SA 3.0 |