Question

finite atomaton that accept the regular expression of any number of b's is​

Answer 1

Answer:

At the time of transition, the automata can either move to the next state or stay in the same state. Finite automata have two states, Accept state or Reject state. When the input string is processed successfully, and the automata reached its final state, then it will accept.

Step-by-step explanation:

It's Pandit Manish

Answer 2

hope this answer helps you ❤☺:)