CSC 341 (Fall 2021)

Lab: DFA Basics

Problem 1: Connect the Dots

Answer the following questions about the fundamental definitions that connect languages, machines, and computation.

Problem 2: Tracing the Lines

Consider the following DFA \(D\):

A sample deterministic finite automata over the alphabet \Sigma = \{\, 0, 1 \,\}.