Timeline for How to convert this regular grammar into a finite state automaton?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2021 at 10:48 | history | edited | Amessihel | CC BY-SA 4.0 |
fixed, thanks to @rici
|
| Oct 5, 2021 at 8:02 | vote | accept | Amessihel | ||
| Oct 1, 2021 at 15:38 | answer | added | rici | timeline score: 1 | |
| Oct 1, 2021 at 11:02 | comment | added | Amessihel | @YuvalFilmus, oh thanks, I believed they have to be deterministic. | |
| Oct 1, 2021 at 9:09 | comment | added | Yuval Filmus | Regular grammars correspond to NFAs. | |
| Oct 1, 2021 at 7:35 | comment | added | Amessihel |
@greybeard I made a typo by writing abc, sorry (edit accepted).
|
|
| S Oct 1, 2021 at 7:33 | history | suggested | greybeard | CC BY-SA 4.0 |
correct mandatory literal word part, spelling, capitalisation
|
| Oct 1, 2021 at 4:29 | comment | added | greybeard | (The left-regular grammar in the text hyperlinked seems to accept words ending in bac, only.) | |
| Oct 1, 2021 at 4:28 | review | Suggested edits | |||
| S Oct 1, 2021 at 7:33 | |||||
| S Sep 30, 2021 at 21:19 | review | First questions | |||
| Oct 7, 2021 at 5:37 | |||||
| S Sep 30, 2021 at 21:19 | history | asked | Amessihel | CC BY-SA 4.0 |