Timeline for Does a pushdown automata exists for the following language?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 1, 2018 at 15:38 | history | edited | David Richerby | CC BY-SA 4.0 |
title
|
| Aug 29, 2018 at 12:44 | answer | added | David Richerby | timeline score: 2 | |
| Aug 29, 2018 at 12:37 | history | edited | David Richerby | CC BY-SA 4.0 |
Given the languages distinct names
|
| Aug 29, 2018 at 11:49 | comment | added | Raphael | Also, what exactly do you mean by "mixture"? | |
| Aug 29, 2018 at 11:49 | comment | added | Raphael | See our reference question for detailed explanations on how to prove that your language is not context-free. | |
| Aug 29, 2018 at 11:48 | history | edited | Raphael |
edited tags
|
|
| S Aug 29, 2018 at 11:19 | history | suggested | Gokul | CC BY-SA 4.0 |
fixed grammar
|
| Aug 29, 2018 at 4:30 | comment | added | Yuval Filmus | Your new languages are also not context-free. You can prove it using the pumping lemma. | |
| Aug 29, 2018 at 4:19 | comment | added | rballiwal | I did not get you, like iam asking that the modification of non cfl = ( a^n b^n c^n) to (a^n b^n c^n d^n) will make the later a cfl or not | |
| Aug 29, 2018 at 3:46 | comment | added | Gokul | I'd suggest you fix the grammar in your question - as it stands, it's a bit difficult to understand what you are trying to ask. | |
| Aug 29, 2018 at 3:46 | review | Suggested edits | |||
| S Aug 29, 2018 at 11:19 | |||||
| Aug 29, 2018 at 3:15 | review | First posts | |||
| Aug 29, 2018 at 4:30 | |||||
| Aug 29, 2018 at 3:14 | history | asked | rballiwal | CC BY-SA 4.0 |