Timeline for Finding total valid strings of length N that could be formed using characters A,B and C which satisfies given criteria
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 17, 2020 at 11:34 | vote | accept | Garuda | ||
| Apr 12, 2020 at 8:05 | answer | added | CodeChef | timeline score: 1 | |
| Apr 12, 2020 at 7:40 | comment | added | Yuval Filmus | Construct a DFA (our unambiguous NFA) for the language, and use the transfer method technique. There are several answers on this site with examples of this method. | |
| Apr 12, 2020 at 7:40 | review | First posts | |||
| Apr 12, 2020 at 9:45 | |||||
| Apr 12, 2020 at 7:37 | history | asked | Garuda | CC BY-SA 4.0 |