Timeline for Non Deterministic Turing Machine
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24, 2020 at 7:55 | comment | added | Steven | The empty language. It has no accepting states. | |
| Apr 24, 2020 at 7:53 | comment | added | Shyamalendu Kandar | Which language does it accept? | |
| Apr 23, 2020 at 17:17 | comment | added | Steven | Just any non deterministic Turing machine? $\langle \{ q_0 \}, \{ \epsilon \}, q_0, \epsilon, \emptyset, \delta \rangle$, where $\delta=\{ (q_0, \epsilon, q_0, \epsilon, \texttt{left}), (q_0, \epsilon, q_0, \epsilon, \texttt{right}) \}$. I'm following this definition. | |
| Apr 23, 2020 at 12:32 | comment | added | Shyamalendu Kandar | Can you give an example of a NDTM? (state, stack symbol) --> more than one transitional functions? | |
| Apr 7, 2020 at 20:15 | history | edited | Steven | CC BY-SA 4.0 |
deleted 3 characters in body
|
| Apr 7, 2020 at 18:11 | history | answered | Steven | CC BY-SA 4.0 |