Question

problems. The exam will be graded out of 300 points equalling up to 20% of your final grade. Good luck! 1. What does DFA stand for? (10 points) 2. Write the set former for the language with alphabet (a, b) that accepts strings that begin with a symbol a and end in another symbol a but also accepts an empty string. (10 points)

Answer 1

1) DFA stands for Deterministic Finite Automata.

2)

The set former for the Language L is given as:

L = {awa | w belongs to (a + b)* } U {empty}