1) For the automaton language below: (attached in image) a) Graph of the corresponding DFA b) DFA State Transition Matrix. 2) For the expression for (a | bc)*(aca | bcb |

1) For the automaton language below:

(attached in image)

a) Graph of the corresponding DFA

b) DFA State Transition Matrix.

2) For the expression for (a | bc)*(aca | bcb | cab)ccc:

Yo. The automaton graph.

ii. A(∑, Q, q0, F, ∂).

3) Write the automaton for the following language.

Alphabet ∑= {0, 1}

Strings of (0 | 1)+. Where it is fulfilled:

a) Strings must contain at least one 1001.

b) It should not have 0101.

c) If starting with 0 ends with 0.

d) If it starts at 1 it doesn't matter what it ends with.

4) For the following Non-Regular expression:

a3n-2 bn+2 c3n-1 d2n+2 n>0

a) Write the stack automaton.

b) State transition table

c) Python program with the program solution and being able to test them

5) For the expression:

a2n+3 b3m+1 c2p+2 n>=0, m>=0, p>=0.

a) Write the AFD automaton is not stack

b) State transition matrix.