Timeline for DFA - Accept all strings that does not contain a certain substring [duplicate]
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| Feb 12, 2017 at 11:18 | vote | accept | Peter Yakob | ||
| Feb 9, 2017 at 20:38 | history | edited | Peter Yakob | CC BY-SA 3.0 |
added 1 character in body
|
| Feb 9, 2017 at 20:35 | review | Reopen votes | |||
| Feb 9, 2017 at 23:22 | |||||
| Feb 9, 2017 at 20:19 | comment | added | D.W.♦ | Your question is already covered by an answer to our reference question on the subject. I encourage you to read through the material there, as that will teach you not only how to solve this particular problem but also how to approach other similar problems in the future. | |
| Feb 9, 2017 at 20:18 | history | edited | Peter Yakob | CC BY-SA 3.0 |
deleted 138 characters in body
|
| Feb 9, 2017 at 20:17 | history | closed | D.W.♦ | Duplicate of How to prove a language is regular? | |
| Feb 9, 2017 at 20:17 | answer | added | Peter Yakob | timeline score: 3 | |
| Feb 9, 2017 at 20:13 | comment | added | Raphael | Please post your answer as an answer! | |
| Feb 9, 2017 at 19:22 | history | edited | Peter Yakob | CC BY-SA 3.0 |
Added the solution to my problem (Image 3)
|
| Feb 9, 2017 at 18:46 | history | edited | Peter Yakob | CC BY-SA 3.0 |
Added new image of a automata that excepts all strings that contains substring "abc"
|
| Feb 9, 2017 at 18:17 | history | edited | Evil | CC BY-SA 3.0 |
Cropped image
|
| Feb 9, 2017 at 17:50 | review | First posts | |||
| Feb 9, 2017 at 20:20 | |||||
| Feb 9, 2017 at 17:49 | history | asked | Peter Yakob | CC BY-SA 3.0 |