Automata q0 ∈ F but no transitions to itself.

46 Views Asked by At

I stumbled upon the following question, hoping someone could be of help.

Q: A secretive developer at your company refuses to reveal the details of her DFSA implementation for the gamepad controller M =< Q, Σ, , q0, F >. After a few drinks, she inadvertently reveals that q0 ∈ F. Can you name one sequence of commands that is accepted by her automaton? Justify your answer.

My thought process was the following: (always taking into consideration the attached diagram.)

Correct me if I’m wrong, but can one say that if he had to stay in the same position i.e. the transition would be ε to the robot he would reach state A?

Diagram

TIA

1

There are 1 best solutions below

2
On

Yes, if the initial state is accepting, then the automaton accepts the empty sequence. (How you communicate the empty sequence to the automaton is not yet revealed.)