3 3 votes Subject: Finite Automata Topic: DFA Q) Can anyone explain me how i can find the no of strings of length k words that is accepted by a given DFA. Do post the resources which can be helpful to understand this concept. Theory of Computation theory-of-computation finite-automata + – nishu_gate 1.4k views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Gate Keeda commented Sep 11, 2014 reply Follow flag https://www.facebook.com/groups/core.cs/permalink/829620197070235/ this discussion may help. 2 2 replyShare air1 commented Jul 5, 2017 reply Follow flag I think this can be done by finding the $kth$ power of the adjacency matrix of the DFA. The entry in $ith$ row and $jth$ column of this matrix will represent the number of paths of length $k$ from node $i$ to node $j$. Can someone confirm if this is correct? 0 0 replyShare Please log in or register to add a comment.
1 1 vote This should be specific to a given DFA. gatecse answered Sep 10, 2014 gatecse comment Share Follow 0 reply Please log in or register to add a comment.
