If we have a finite automaton that accepts a string,
is there any numerical relationship that always is true like S ≥ |w| or something similar?
Where |w| the length of the string and S the number of transited states (counting multiplicities).
For example, if we have this automata and the string w = 010 :
S = 3 and |w| = 3.
In this case, S = |w|
I'm new in computer science and i was thinking there has to be a rule of that kind but I have not found explicitly in the books that I started on computational theory.