Timeline for If regex describes FSAs, what string formats describe Turing machines?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 18, 2021 at 18:21 | comment | added | Daniel Wagner | "However, it is my suspicion that not every state diagram can be constructed in Brainfuck." -- Not every DFA can be constructed from a regex. We only prove that every DFA has a regex that accepts the same language, not that every DFA is a target of the regex->DFA translation. The situations with Turing machines/Brainfuck is analogous. | |
| Jun 18, 2021 at 14:22 | vote | accept | Tsskyx | ||
| Jun 18, 2021 at 9:55 | history | became hot network question | |||
| Jun 18, 2021 at 6:20 | answer | added | Pseudonym♦ | timeline score: 3 | |
| Jun 18, 2021 at 4:30 | answer | added | D.W.♦ | timeline score: 2 | |
| Jun 18, 2021 at 1:58 | review | First posts | |||
| Jul 2, 2021 at 1:57 | |||||
| Jun 18, 2021 at 1:54 | history | asked | Tsskyx | CC BY-SA 4.0 |