DFA (Deterministic Finite Automata)

[Apprentice123]

If I have a DFA M = ({q0}, {a,b1}, delta, q0, {q0}) where:

q0 => go "a,b" to q0


What language will be recognized by the automaton?

[Apprentice123]

Does anyone understand this problem?

[bobdark]

{a,b}* if you meant your alphabet to be{a,b,1}

[Apprentice123]

{a,b}* if you meant your alphabet to be{a,b,1}

Sory the correct is:
M = ({q0}, {a,b}, delta, q0, {q0})

[bobdark]

still {a,b}* - you got 1 state which is a receiving state and you always stay there.