Timeline for Has anyone mixed linear algebra with formal language theory in this way?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
| Sep 20, 2013 at 19:51 | comment | added | Artem Kaznatcheev♦ | @EnjoysMath To see an example of using linear algebra and eigevalues directly to address the number of accepted words, see my answer on the question Yuval mentioned. Note, that this approach is not that easy to generalize to reducible DFAs without using the generating functions approach. | |
| Sep 20, 2013 at 5:25 | vote | accept | Daniel Donnelly | ||
| May 30, 2018 at 16:42 | |||||
| Sep 20, 2013 at 3:15 | comment | added | Yuval Filmus | Well, your approach isn't clear, but one way to get something out of it is along the lines I describe. There could be other ways. | |
| Sep 20, 2013 at 2:27 | comment | added | Daniel Donnelly | How is this the generating function approach? | |
| Sep 20, 2013 at 2:21 | vote | accept | Daniel Donnelly | ||
| Sep 20, 2013 at 2:22 | |||||
| Sep 20, 2013 at 2:17 | history | answered | Yuval Filmus | CC BY-SA 3.0 |