For a machine with N number of states the total number of-04593
For a machine with N number of states the total number of strings to be tested, defined over an alphabet of m letter is __________
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Final Term - Quiz No.1.
For a machine with N number of states the total number of strings to be tested, defined over an alphabet of m letter is __________
Nm+Nm+1+Nm+2+---------+N2m-1
m^N+m^N+1+m^N+2+----------+m2N-1
Nm
mN
