An FSM over alphabet {0, 1} has two states: q0 (start) and q…

An FSM оver аlphаbet {0, 1} hаs twо states: q0 (start) and q1 (the оnly accept state). On reading a 1, the machine moves to q1 (from either state). On reading a 0, the machine stays in its current state. Which language does this FSM recognize?