Midterm Exam (with slight correction: a reference to `the first part` of a problem should have been to `the previous problem`). Midterm including solutions...

Homeworks All homeworks are due at the start of your Friday discussion section on paper unless otherwise stated. ProblemSet 1, Due Friday August 31. (Short...

CS 301, Spring 2012, Problem Set 11 1 Please read the article Computing Machinery and Intelligence, by Alan Turing, which appeared in Mind in 1950. You can find...

CS 301 Fall 2012 Problem Set 1 This assignment is a review of set notation, etc..., and is easier than future assignments. In the Sipser text : Exercises: 0.3,...

CS 301 Problem Set 10, Due Friday, April 6, 2012 1 Consider a new version of the Turing machine that has one additional operation: Bomb! When it executes the...

CS 301, Spring 2012, Problem Set 12 1. Listen to the keynote at the 28th Chaos Computer Congress (28C3) from December 2011 by Meredith Patterson on entitled The Science...

CS 301, Spring 2012, Problem Set 2 1 Give examples to show that: 1 The intersection of two coubtably infinite sets can be finite 1 or it can be countably...

CS 301, Spring 2012, Problem Set 3 Instructions for submission: Construct the DFAs and NFAs for the following problems using JFLAP, and turn in your automata using...

CS 301 Spring 2012 Problem Set 4 1 Prove that every finite language must be regular. (Hint: Use induction on the size of the language.) 1 Consider the class...

Problem Set 5, CS 301, Spring 2012 Regular Problems 1 Using Java syntax, give a regular expression for valid US phone numbers. Remember such things as that there...

Problem Set 6, CS 301, Spring 2012 1 Below is a modest extension of the context free grammar for English from Sipser, p. 101, using the variable S for Sentence...

CS 301, Spring 2012, Problem Set 7 Due Friday, March 9 (yes, just 2 days) 1 Construct a Turing Machine in full detail to decide the language: \{ a^ n b^m : n...

Problem Set 8, CS 301 Spring 2012 Due Friday, March 16 (right before the start of Spring Break) 1 Review: We need more practice converting NFAs to DFAs. We already...

CS 301, Spring 2012 Problem Set 9 1 Let L be a language that has an enumerator that outputs all the strings of L in lexicographic order. (Review Sipser, page...

Programming issues for really using Java regex for Huntingtons problem To get \s inside a Java string, you will need to write \\s. The way the newline character...

Reading Assignments I strongly recommend the following reading before the relevant classes. The appropriate pages for the 2nd edition of the textbook are mentioned...

Syllabus: CS 301, Languages and Automata (Fall 2012) This course requires registration in both Lecture and Class Problem Session sections, shown below: Lectures: Monday...

TWiki`s CS301 web The 1 web of TWiki. TWiki is a Web Based Collaboration Platform for the Enterprise.

CS 301 Languages and Automata (Fall 2012) Announcements (Wednesday, December 12, 2012) I`ve got a bad cold today and don`t want to make anyone sick during exam...

Syllabus Homeworks Reading Assignments Board Additional Material edit this menu 1 Web Create New Topic Index Search...

This is a subscription service to be automatically notified by e mail when topics change in this 1 web. This is a convenient service, so you do not have to come...

CS301 Web Preferences The following settings are web preferences of the CS301 web. These preferences overwrite the site level preferences in . and...

/CS301 The 1 web of TWiki. TWiki is a Web Based Collaboration Platform for the Enterprise.

Statistics for CS301 Web Month: Topic views: Topic saves: File uploads: Most popular topic views: Top contributors for topic save...

Number of topics: 30

See also the faster WebTopicList

This topic: CS301 > WebIndex

Topic revision: r1 - 2006-11-15 - 19:43:52 - TWikiContributor

Copyright 2016 The Board of Trustees of the University of Illinois.webmaster@cs.uic.edu |
WISEST Helping Women Faculty Advance Funded by NSF |