Timeline for Why NFA is called Non-deterministic?
Current License: CC BY-SA 3.0
27 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24 at 19:06 | answer | added | Bader Abu Radi | timeline score: 2 | |
| Jul 24 at 18:44 | answer | added | Stefk | timeline score: 2 | |
| Jul 4, 2020 at 7:03 | vote | accept | Madhusoodan P | ||
| Sep 8, 2017 at 12:36 | comment | added | Madhusoodan P | Well here is something my friend has to say. For a particular string w after consuming it you cannot tell the particular state's name (A single state's name) where the machine has reached. which is non-determinism. Well it seems sound, but the machine design itself is such that you always end up with set of states rather than a single one. But set is also deterministic (you can determine) right? | |
| Sep 7, 2017 at 18:07 | comment | added | rus9384 | @MadhusoodanP, yes, non-determinism is exactly that thing. The most interesting moment is that it's possible that such machines exist in reality. | |
| Sep 7, 2017 at 17:56 | answer | added | MatthewRock | timeline score: 2 | |
| S Sep 7, 2017 at 16:23 | history | suggested | CommunityBot | CC BY-SA 3.0 |
removed unused abbreviation and added wikipedia link.
|
| Sep 7, 2017 at 14:39 | review | Suggested edits | |||
| S Sep 7, 2017 at 16:23 | |||||
| Sep 7, 2017 at 12:48 | comment | added | Madhusoodan P | Now I am totally messed up. Do the non-determinism really exist in machines? Because every state change that occurs in the machine is dependent on some history (Well may be it's not history of the same code that you are running) or current state of machine. Then from where the concept of non-determinism arises? | |
| Sep 7, 2017 at 9:51 | comment | added | adrianN | @Trilarion cs.stackexchange.com/questions/5008/… | |
| Sep 7, 2017 at 9:17 | comment | added | NoDataDumpNoContribution | @adrianN I wonder what the difference is between nondeterministic and probabilistic in theoretical computer science? | |
| S Sep 7, 2017 at 7:17 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
NFA == non-deterministic finite automaton
|
| S Sep 7, 2017 at 7:17 | history | suggested | DarcyThomas | CC BY-SA 3.0 |
NFA == non-deterministic finite automaton
|
| Sep 7, 2017 at 4:49 | review | Suggested edits | |||
| S Sep 7, 2017 at 7:17 | |||||
| Sep 7, 2017 at 4:24 | comment | added | Wildcard | @DarcyThomas, the first introduction I had was swtch.com/~rsc/regexp/regexp1.html. It's a good read—it's not the purpose of the article to introduce NFAs, but it does a good job of doing so in discussion of regular expressions. | |
| Sep 7, 2017 at 3:42 | comment | added | DarcyThomas | What is a NFA? (For the unenlightened among us) | |
| Sep 6, 2017 at 19:48 | answer | added | Yakk | timeline score: 5 | |
| Sep 6, 2017 at 19:01 | answer | added | Cort Ammon | timeline score: 1 | |
| Sep 6, 2017 at 16:14 | history | tweeted | twitter.com/StackCompSci/status/905464354325323776 | ||
| Sep 6, 2017 at 15:35 | comment | added | reinierpost | It's the choice between the transitions that is nondeterministic. | |
| Sep 6, 2017 at 15:28 | answer | added | D.W.♦ | timeline score: 24 | |
| Sep 6, 2017 at 13:36 | answer | added | Madhusoodan P | timeline score: 0 | |
| Sep 6, 2017 at 13:32 | comment | added | adrianN | Nondeterministic as used in theoretical computer science is different from random. | |
| Sep 6, 2017 at 13:14 | answer | added | Schonfinkel | timeline score: 10 | |
| Sep 6, 2017 at 13:14 | answer | added | Yuval Filmus | timeline score: 6 | |
| Sep 6, 2017 at 12:56 | review | First posts | |||
| Sep 6, 2017 at 13:09 | |||||
| Sep 6, 2017 at 12:52 | history | asked | Madhusoodan P | CC BY-SA 3.0 |