Timeline for What is the deterministic finitite automaton (DFA) for the regex ".*b."
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 6, 2020 at 20:13 | answer | added | cevra | timeline score: 0 | |
| Nov 3, 2017 at 18:39 | history | edited | Good Night Nerd Pride | CC BY-SA 3.0 |
added 195 characters in body
|
| Nov 3, 2017 at 18:35 | vote | accept | Good Night Nerd Pride | ||
| Nov 3, 2017 at 18:10 | answer | added | David Richerby | timeline score: 2 | |
| Nov 3, 2017 at 17:43 | comment | added | Good Night Nerd Pride | @DavidRicherby well that's good to now, but which one is it? | |
| Nov 3, 2017 at 17:40 | comment | added | David Richerby | "Is there even a DFA for this regular expression?" there are DFAs for all regular expressions: this is Kleene's theorem (not to be confused with Kleene's recursion theorems, which are something completely different.) | |
| Nov 3, 2017 at 17:30 | comment | added | Good Night Nerd Pride | @klaus I updated the question w/ an example. | |
| Nov 3, 2017 at 17:29 | history | edited | Good Night Nerd Pride | CC BY-SA 3.0 |
added 192 characters in body
|
| Nov 3, 2017 at 17:20 | comment | added | klaus | Can you give an example of a string that you think the DFA (from the site) won't match? | |
| Nov 3, 2017 at 16:38 | history | asked | Good Night Nerd Pride | CC BY-SA 3.0 |