DFA doubt

Question

let M be a DFA {a,b} with exactly 2 state .Suppose further that M accepts a finite number n of distinct words .what is the maximum value of n?

a)1

b)2

c)3

d)4

e)there not fixed

Comments

Ohh  I understood

thanks :)

actually I just started TOC  and also I'm  not good in this subject

---

it's very easy subject and it contains very tricky questions, Most of the times we fail to catch the twist in the question.

---

yes ..also it takes very less time consuming  to answer the TOC  questions if you know the concept behind this ...that'Y  i  just focus on it

now let C how much can i cover :3

Answer 1

in my opinion the answer should be 1. and only one possible string ( epsilon ).

opinion:

1.since the language is finite then this means there should not be any kind of loop. on any of the state trough which finla state can be reached

2. now as said that dfa has 2 states ( assuming they are fixed ) means the both of the state need to define the the transition on the symbol (a, b).

3. no self loop or any other loop ( form step 1) means that from start state we nee to go to second state( as this is only option).

4. now on second state nmo loop possible thus only one state to go that is state 1 but going there will create a loop between states thus this state should be dead state.

5. why not be 1 state dead - beacuse if it were then no two sate were needed.

6. now since you said finite  we have two choices either empty or epsilon but given that maximum then epsilon.