3 votes 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 asked Sep 10, 2014 • retagged Sep 26, 2014 by Arjun nishu_gate 929 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Gate Keeda commented Sep 11, 2014 reply Follow Share https://www.facebook.com/groups/core.cs/permalink/829620197070235/ this discussion may help. 2 votes 2 votes air1 commented Jul 5, 2017 reply Follow Share 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 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes This should be specific to a given DFA. gatecse answered Sep 10, 2014 gatecse comment Share Follow See all 0 reply Please log in or register to add a comment.