# Theory Of Computation Test – Question 12

Consider the following statements.

1.  If a DFA M accept any string at all, then it accepts one whose length is less than the number of states in M.
2. If a DFA M accepts all the strings of length less than the number of states in M then L(M) is always ${\sum}&space;^*$where $\sum$ is the alphabet.

Which of the above sentences is/are correct ?

• 1.
• 2.
• 3.
• 4.