Which of the following statements about finite state machines are true? Select all that apply (one or more). A finite state machine can have multiple accepting states. Any regular expression can be expressed as a finite state machine. Any language can be formally described using a finite state machine. A finite state machine can have multiple starting states..