CS 3530: Assignment 1b
Fall 2017
Note: In each of the following, you should show and describe the simpler DFAs as well as the final NFA
that you construct. You must follow the steps of each constructi
% Macros for Computational Theory diagrams
% by Russ Ross
% Last revised January 2010
verbatimtex
\documentclass [10pt]cfw_article
\usepackagecfw_amsmath
\begin cfw_document
etex;
% set up for huge no
Theory macros for Metapost
=
I wrote these macros to make it easier to create diagrams of finite
automata (DFAs and NFAs), pushdown automata (PDAs), Turing machines,
etc. I use LaTeX to prepare my sli
CS 3530: Assignment 1c
Fall 2015
Exercises
Exercise 1.8b (3 points)
Problem
Use the construction given in the proof of Theorem 1.45 to give the state diagrams of NFAs recognizing the
union of the lang
Finite Automata using Metapost Macros
Russ Ross
1
Simple Example
Here is a DFA that accepts strings over = cfw_a, b with an even number of
as and an even number of bs. Using curve curves the edge slig
CS 3530: Assignment 1b
Fall 2015
Exercises
Note: In each of the following, you should show and describe the simpler DFAs as well as the nal NFA
that you construct. You must follow the steps of each co
CS 3530: Assignment 1c
Fall 2017
Exercise 1.15 (6 points)
Problem
Give a counterexample to show that the following construction fails to prove Theorem 1.49, the closure of
the class of regular languag