CSCI 301 L23 Worksheet

Lecture 23 - Exercises

Part A - The Language Accepted by a FA

Consider again the following DFA over alphabet $Σ = {0, 1}$ :

Which of the following strings are accepted by this machine?

$1$
$00$
$001$
$10101$
$100$
$1000$
Describe (informally, in English) the language accepted by this machine.

Part B - DFA Design

Draw a diagram for a DFA that accepts each of the following languages over the alphabet ${a, b}$ .

$L = {a}$
$L = {a b, a b a b, a b a b a b, \dots}$
$L = \emptyset$
$L = {ϵ}$

Draw a diagram for a DFA for each of the following languages over $Σ = {0, 1}$ :

$L = {w : | w | is even}$
$L = {w : w ends with a 1}$