204 views
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.
retagged | 204 views
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?

+1 vote
This should be specific to a given DFA.