Timeline for Is there an algorithm that given a PDA $M$ decides if there exists a string in $L(M)$ with a suitable decomposition?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 17, 2017 at 17:11 | comment | added | D.W.♦ | It appears you may have created multiple accounts. I encourage you to merge them. Also, I encourage you to register your account so you can retain access to it. This will allow you to post comments under an answer requesting clarification. (Those comments should not be posted in the 'answer' box.) | |
| S May 16, 2017 at 17:57 | history | suggested | Hans Hüttel | CC BY-SA 3.0 |
Formatting.
|
| May 16, 2017 at 13:59 | review | Suggested edits | |||
| S May 16, 2017 at 17:57 | |||||
| May 16, 2017 at 13:57 | answer | added | Hans Hüttel | timeline score: 2 | |
| May 16, 2017 at 11:01 | review | First posts | |||
| May 16, 2017 at 17:58 | |||||
| May 16, 2017 at 10:59 | history | asked | user72145 | CC BY-SA 3.0 |