Timeline for Word Problem over Finite Groupoids
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 3, 2019 at 7:26 | vote | accept | Evgeniy Gryaznov | ||
| Mar 23, 2019 at 15:00 | history | tweeted | twitter.com/StackCompSci/status/1109469952988323842 | ||
| Mar 23, 2019 at 13:04 | comment | added | Hendrik Jan | Also note the dynamic programming solution for this problem is equivalent to the CYK-algorithm for parsing context-free grammars. The multiplication rules of the groupoid match production rules for a context-free grammar in Chomsky normalform. | |
| Mar 22, 2019 at 21:59 | comment | added | John L. | Matrix chain multiplication is a special case of this problem, where the binary operator satisfies the associative law. | |
| Mar 22, 2019 at 21:33 | answer | added | John L. | timeline score: 6 | |
| Mar 22, 2019 at 16:59 | comment | added | D.W.♦ | Hint: study en.wikipedia.org/wiki/Matrix_chain_multiplication | |
| Mar 22, 2019 at 16:58 | comment | added | D.W.♦ |
See cs.stackexchange.com/tags/dynamic-programming/info for some guidance on how to approach dynamic programming algorithms. Incidentally, using the same variable name (i) for two purposes is unnecessarily confusing. Also, we'd generally prefer that you avoid sharing specific Python code and instead provide concise pseudocode that doesn't require knowledge of any particular programming language to understand.
|
|
| Mar 22, 2019 at 16:28 | history | edited | xskxzr |
edited tags
|
|
| Mar 22, 2019 at 11:10 | review | First posts | |||
| Mar 22, 2019 at 16:28 | |||||
| Mar 22, 2019 at 11:09 | history | asked | Evgeniy Gryaznov | CC BY-SA 4.0 |