Timeline for Working of NPDA
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 9, 2017 at 7:05 | history | edited | Zephyr | CC BY-SA 3.0 |
edited title
|
| Oct 9, 2017 at 7:03 | vote | accept | Zephyr | ||
| Oct 8, 2017 at 23:03 | answer | added | fade2black | timeline score: 3 | |
| Oct 8, 2017 at 22:17 | comment | added | Zephyr | @fade2black I read your answer. You said "Each branch may accept or reject input. If at least one branch halts with accept then the NPDA accepts that input. Otherwise it rejects." . Now what if that one branch is the one which accepts the prefix of the language before other branches ? What happens to other branches? | |
| Oct 8, 2017 at 22:09 | comment | added | fade2black | Your question is not answerable. First, your title does not suite the body of your post, please improve it. Second, according to your questions you seem to confuse how a PDA/NPDA works and it has nothing to do with the "prefix property". If you do not understand how PDA/NPDA/DPDA operates, you can ask a specific question which part of the definition you do not understand. We already have a similar question here. | |
| Oct 8, 2017 at 20:24 | comment | added | Raphael | The title you have chosen is not well suited to representing your question. Please take some time to improve it; we have collected some advice here. Thank you! | |
| Oct 8, 2017 at 20:23 | comment | added | Raphael | "Here we can have many copies of machine running simultaneously" -- that's not a useful intuition. Stick with the definition! | |
| Oct 8, 2017 at 20:23 | history | edited | Raphael |
edited tags; edited tags
|
|
| Oct 8, 2017 at 18:34 | history | asked | Zephyr | CC BY-SA 3.0 |