I am not sure if this is the correct forum to post this question.

But, I have this problem:

"

1. Create the finite state automaton described below:

- The finite automaton has states: A, B, C, and D.

- The start state is B.

- The final states are A and C.

- The alphabet is Σ= {a, b}

- The transitions are given by the following table:

The interior entries in the table represent the end state after the input is processed.

Input a Input b

Initial State-A A B

Initial State-B C D

Initial State-C B A

Initial State-D A C

(darn, can't get these to line up! But, it should be a table)

The interior entries in the table represent the end state after the input is processed.

"

I have created the states A, B, C, D. I made B the initial state, and A and C the final states per the requirements. What is really confusing me is having the initial state as B, and A and C as the final states.

I wish I could post a picture here of what I came up with, but will try to describe. I tried to follow the state table:

I did a loop for 'a' on A

'b' edge from A to B

'a' edge from B to C

'a' edge from C to B

'b' edge from C to D

'b' edge from C to A

'a' edge from D to A

'b' edge from B to D

I hope that makes sense. If not, let me know where I can side the pic.

Anyway, I am confused by B as the initial state, and A and C as the final. SO, I am not sure how to create the finite state automata from this.

Can anyone please help??