Timeline for Show that the Pumping Lemma for CFLs is not powerful enough to prove that the language L = {aibjck |i ≠j ≠ k ≠ i } is not context free
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 20, 2018 at 12:07 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 20, 2018 at 11:44 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 21, 2018 at 11:19 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 21, 2018 at 10:39 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 22, 2018 at 10:11 | answer | added | Hendrik Jan | timeline score: 3 | |
| Mar 22, 2018 at 10:01 | history | edited | Hendrik Jan | CC BY-SA 3.0 |
\LaTeX
|
| Mar 22, 2018 at 9:29 | comment | added | Raphael | Welcome to Computer Science! Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction. | |
| Mar 22, 2018 at 0:23 | comment | added | user86060 | Have you tried w = bcc. The professor hinted to find a w such that it is not pumpable. | |
| Mar 21, 2018 at 22:51 | review | First posts | |||
| Mar 22, 2018 at 10:59 | |||||
| Mar 21, 2018 at 22:48 | history | asked | John | CC BY-SA 3.0 |