Theory of Computation-Finite Automata

4

5

6

7

Σ * Q -> Σ

Q * Q -> Σ

Σ * Σ -> Q

Q * Σ -> Q

3

2

1

can’t be represented.

Q * Σ* -> Q

Q * Σ -> Q

Q* * Σ* -> Σ

Q * Σ -> Σ

δ((q,y),a)

δ(δ*(q,y),a)

δ(q,ya)

independent from δ notation

δ*(q,x) E A

δ(q,x) E A

δ*(Q0,x) E A

δ(Q0,x) E A

If it is accepted by automata

If it halts

If automata touch final state in its life time

All language are language of automata

Type 0

Type 1

Type 2

Type 3

1

2

0

3

It can’t remember arbitrary large amount of information

It sometimes recognize grammar that are not regular

It sometimes fails to recognize regular grammar.

All of the mentioned