hw3css - CSE 105: Introduction to the Theory of Comptuation...

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

View Full Document Right Arrow Icon
CSE 105: Introduction to the Theory of Comptuation Fall 2010 Problem Set 3 Instructor: Daniele Micciancio Due on: Wed. Oct. 20, 2010 Guidelines: Same as for homework 1. Solutions to the homework should be submitted electronically using turnin, and you should submit a single pdf file together with 2 jflap files (2.jff,3.jff), all zipped together. Problem 1 Let L be the set of all strings (over the alphabet { 0 , 1 , + , = } ) of the form x + y = z , where x,y and z are the binary representation of three numbers such that the sum of x and y equals z . For example 110 + 11 = 1001 is in L . Prove that the language L is not regular using the pumping lemma. Problem 2 Transform the following automaton into a regular expression using the procedure studied in class. (Remember this involves introducing a new start and final state, and then remove all other nodes using GNFA.) Submit the resulting regular expression as a jflap file 2.jff. In the writeup, say in which order you removed the nodes.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/08/2011 for the course CSE cse105 taught by Professor Cs during the Fall '10 term at UCSD.

Page1 / 2

hw3css - CSE 105: Introduction to the Theory of Comptuation...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online