hw02 - 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

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

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

Unformatted text preview: CS 154 Intro. to Automata and Complexity Theory Handout 6 Autumn 2006 David Dill October 10, 2006 Problem Set 2 Due: October 17, 2006 Homework: (Total 100 points + 20 extra) Do the following exercises. Problem 1. [10 points] Consider the -NFA defined in the following tran- sition table. a b c p { q, r } { q } { r } q { p, q } { p } { p, r } * r a). Compute the -closure of each state. b). Convert this -NFA into an DFA using the construction described in class. You must provide the transition table of the resulting DFA. Problem 2. [20 points] Provide regular expressions for the following lan- guages over the alphabet = { , 1 } . Provide a brief explanation as to why your regular expressions generate the given languages. a). The set of all strings not containing 111 as a substring. b). The set of all strings in which all pairs of adjacent 0s appears before all pairs of adjacent 1s....
View Full 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

hw02 - 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