Timeline for DFA for even concatenation of strings from a language
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 30, 2023 at 9:54 | comment | added | Rodrigo de Azevedo | On Haskell, you might want to take a look at this | |
| Nov 30, 2023 at 8:50 | comment | added | Rodrigo de Azevedo | Append a diagram of a toy DFA and I will post the Haskell code. | |
| S Nov 30, 2023 at 7:40 | history | suggested | Rodrigo de Azevedo | CC BY-SA 4.0 |
Minor improvements
|
| Nov 23, 2023 at 21:44 | review | Suggested edits | |||
| S Nov 30, 2023 at 7:40 | |||||
| Nov 23, 2023 at 4:42 | answer | added | J.-E. Pin | timeline score: 1 | |
| Oct 16, 2023 at 3:07 | comment | added | ShyPerson | Do you mean: another DFA which accepts all the strings...? | |
| S Oct 12, 2023 at 5:04 | review | First questions | |||
| Oct 26, 2023 at 5:08 | |||||
| S Oct 12, 2023 at 5:04 | history | asked | Catherine H. | CC BY-SA 4.0 |