# Theory Of Computation Test – Question 4

Consider the language

$L&space;=&space;\left&space;\{&space;w&space;\in&space;\left&space;\{&space;a,b&space;\right&space;\}^*|\,\,abw&space;=&space;wba&space;\right&space;\}$

Consider the following sentences about the above language $L$

1. $L$ is Finite
2. The minimal DFA that accepts $L$ has 3 states.
3. The regular expression for $L$ is  $aba&space;\cup&space;ab(a&space;\cup&space;b)^*ba$
4. The regular expression for $L$ is  $a(ba)^*$

Which of the above statements are correct?

• 1.
• 2.
• 3.
• 4.