{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw1css

# hw1css - CSE 105 Introduction to the Theory of Comptuation...

This preview shows pages 1–2. Sign up to view the full content.

CSE 105: Introduction to the Theory of Comptuation Fall 2010 Problem Set 1 Instructor: Daniele Micciancio Due on: Wed. Oct 6, 2010 Guidelines: solutions to the homework should be submitted electronically, following the instructions on the class website. As part of your solutions to this assignment you should submit: 1. A file with the text of your solutions to all 4 problems, in pdf format. 2. 4 jflap files containing the automata for problems 2 and 3. The main file should be in pdf format (no doc files, etc.) and be clearly divided into 4 sections (and respective subsections) corresponding to the 4 problems. There is no jflap file for problems 1 and 4. All your files (writeup.pdf,2a.jff,2b.jff,3a.jff,3b.jff) should be named and zipped together according to the instructions. Homeworks should be submitted on the due date before class time. 1 Simple DFA questions Let M be the DFA with states Q = { q 1 , q 2 , q 3 , q 4 , q 5 }, input alphabet Σ = { u, d } , transition function δ , start state q 2 and accept states F = { q 2 } where δ is given by the following transition table. δ q 1 q 2 q 3 q 4 q 5 u q 5 q 1 q 2 q 3 q 4 d q 2 q 3 q 4 q 5 q 1 1. Give 3 example strings that are accepted by the DFA 2. Give 3 example strings that are not accepted by the DFA 3. Give a high level English description of M using complete sentences and proper grammar and punctu- ation. This description should be no more than two reasonably short sentences

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}