Timeline for $L =$ { $\langle M \rangle$ | $M$ moves left on at least one input }
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27 at 13:19 | comment | added | Bader Abu Radi | Not sure if this approach simplifies it as the idea is straightforward. Also, there are TMs that can move their head to the left, yet can be simulated by a regular automaton. So proving whether a TM can be simulated by a DFA is decidable or not, needs to also consider machines that can move to the left, but have other restrictions, such as two-way finite automata. | |
| Jan 27 at 12:34 | comment | added | rus9384 | Can this be simplified to "A TM that does not move its head to the left can be simulated with a regular automaton, and whether a TM can be simulated with a regular automaton is decidable"? | |
| Jan 27 at 10:58 | comment | added | Bader Abu Radi | You're welcome! | |
| Jan 27 at 9:52 | vote | accept | Dilara | ||
| Jan 27 at 1:29 | comment | added | Dilara | Wow! Thank you for the great answer!!! | |
| Jan 27 at 1:27 | vote | accept | Dilara | ||
| Jan 27 at 9:52 | |||||
| Jan 27 at 0:04 | history | edited | Bader Abu Radi | CC BY-SA 4.0 |
edited body
|
| Jan 26 at 23:57 | history | edited | Bader Abu Radi | CC BY-SA 4.0 |
added 16 characters in body
|
| Jan 26 at 23:49 | history | edited | Bader Abu Radi | CC BY-SA 4.0 |
added 5 characters in body
|
| Jan 26 at 23:42 | history | answered | Bader Abu Radi | CC BY-SA 4.0 |