The Gateway to Computer Science Excellence
+3 votes
309 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.
in Theory of Computation by
retagged by | 309 views
0
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 Answer

+1 vote
This should be specific to a given DFA.
by
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,345 questions
60,473 answers
201,801 comments
95,278 users