hw03 - CS 154 Intro to Automata and Complexity Theory...

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

View Full Document Right Arrow Icon
CS 154 Intro. to Automata and Complexity Theory Handout 10 Autumn 2006 David Dill October 17, 2006 Problem Set 3 Due: October 24, 2006 Homework: (Total 100 points) Do the following exercises. Problem 1. [15 points] (Exercise 4.2.6(c) on page 147 of the second edition of the textbook) Show that the regular languages are closed under the following operation: init ( L ) = { w | for some x, wx is in L } . Hint : It is easiest to start with a DFA for L and perform a construction to get the desired language. Problem 2. [40 points] Give an algorithm to solve the following deci- sion problems. In each case you can assume that you are given a concrete representation of the language in the form of DFA. You must justify the correctness of the algorithm to receive full credit. a). Suppose L is a regular language over the alphabet Σ = { 0 , 1 } . Give an algorithm to decide whether | L | ≥ 100. b). Suppose L is a regular language over the alphabet Σ = { 0 , 1 } . Give an algorithm to decide whether
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 03/08/2011 for the course CS 154 taught by Professor Motwani,r during the Winter '08 term at Stanford.

Page1 / 2

hw03 - CS 154 Intro to Automata and Complexity Theory...

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