retagged by
909 views
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.
retagged by

1 Answer

Related questions

0 votes
0 votes
0 answers
1
koushriek asked May 19, 2022
1,281 views
Examples of accepted words: 1011, 101101, 1111Example of non-accepted words: 101, 1001, 010The solution says the min-DFA contains 5 states but I could only do it in 4. Am...
8 votes
8 votes
2 answers
4