http:^^www.cs.washington.edu^education^courses^322^96w^cse322-bboard.shtml
来自「This data set contains WWW-pages collect」· SHTML 代码 · 共 1,278 行 · 第 1/3 页
SHTML
1,278 行
Date: Wed, 08 Jan 1997 20:53:29 GMTServer: NCSA/1.4.2Content-type: text/html<html> <head><title>CSE 322 Bboard/Mail Log</title></head><body><h1>CSE 322 Formal Models<br> Bboard/Mail Log<br> Winter 1996</h1>This page contains a log of all email sent to the CSE322 classmailing list <a href="mailto:cse322@cs.washington.edu"><tt>cse322@cs</tt></a>. We will use this list forannouncements of general interest to the class. Students shouldalso feel free to use it to ask questions, post information, orinitiate discussions of general interest to the class. Of course,questions or comments that don't seem of general interest can bedirected to the TA (<a href="mailto:fix@cs.washington.edu"><tt>fix@cs</tt></a>) or instructor(<a href="mailto:ladner@cs.washington.edu"><tt>ladner@cs</tt></a>), instead. <p> Following usual Internet conventions, administrative requestsconcerning the mailing list itself, such as add/delete/addresschange requests, should be addressed to <a href="mailto:cse322-request@cs.washington.edu"><tt>cse322-request@cs</tt></a>.<h2>Index of Messages</h2>(Latest message Friday, 05-Jan-96 11:14:18 PST.)<p><ul><li><a href=#820869253001><tt> 5 Jan 96 ladner@cs _____ Book problem</tt></a><li><a href=#820879907001><tt> 5 Jan 96 fix@cs ________ Welcome to CSE 322</tt></a><li><a href=#821056630001><tt> 7 Jan 96 gracelee@cs ___ Re: Welcome to CSE 322</tt></a><li><a href=#821121656001><tt> 8 Jan 96 ladner@cs _____ Student Question</tt></a><li><a href=#821125527001><tt> 8 Jan 96 ladner@cs _____ Correction in book.</tt></a><li><a href=#821208096001><tt> 9 Jan 96 ladner@cs _____ Student Question on #12 page 39</tt></a><li><a href=#821337194001><tt>10 Jan 96 sca@cs ________ assign# 2</tt></a><li><a href=#821387667001><tt>11 Jan 96 ladner@cs _____ Student Question</tt></a><li><a href=#821392620001><tt>11 Jan 96 xyzzy@u _______ Re: Student Question</tt></a><li><a href=#821431481001><tt>11 Jan 96 marcam@u ______ HW#2, prob3</tt></a><li><a href=#821447985001><tt>12 Jan 96 alxchin@cs ____ Re: HW#2, prob3</tt></a><li><a href=#821468642001><tt>12 Jan 96 ladner@cs _____ Re: HW#2, prob3 </tt></a><li><a href=#821494798001><tt>12 Jan 96 ladner@cs _____ Student Solutions Book</tt></a><li><a href=#821561128001><tt>13 Jan 96 ladner@cs _____ Tuesday office hours</tt></a><li><a href=#822343275001><tt>22 Jan 96 ladner@cs _____ Error in Handout</tt></a><li><a href=#822344834001><tt>22 Jan 96 fix@cs ________ Re: hw4</tt></a><li><a href=#822348549001><tt>22 Jan 96 fix@cs ________ Study Section</tt></a><li><a href=#822682148001><tt>26 Jan 96 ladner@cs _____ Midterm Exam</tt></a><li><a href=#822688441001><tt>26 Jan 96 ladner@cs _____ Correction in Assignment 5</tt></a><li><a href=#822691719001><tt>26 Jan 96 fix@cs ________ Correction on HW#3 solns</tt></a><li><a href=#822936787001><tt>29 Jan 96 ladner@cs _____ Re: Midterm Exam </tt></a><li><a href=#822965574001><tt>29 Jan 96 fix@cs ________ Solutions to assignment 4...</tt></a><li><a href=#823293355001><tt> 2 Feb 96 ladner@cs _____ Resumes</tt></a><li><a href=#823303061001><tt> 2 Feb 96 ladner@cs _____ Bottom-down?</tt></a><li><a href=#823628947001><tt> 6 Feb 96 ladner@cs _____ Why context-free</tt></a><li><a href=#823648432001><tt> 6 Feb 96 ladner@cs _____ Textbook Error</tt></a><li><a href=#823798882001><tt> 8 Feb 96 ladner@cs _____ Office hours today</tt></a><li><a href=#823822918001><tt> 8 Feb 96 ladner@cs _____ Lazowska "almost live"</tt></a><li><a href=#823824925001><tt> 8 Feb 96 fix@cs ________ reminder about DFAs</tt></a><li><a href=#824413747001><tt>15 Feb 96 fix@cs ________ DFA equivalence question</tt></a><li><a href=#825108836001><tt>23 Feb 96 fix@cs ________ hw9 corrections/clarification</tt></a><li><a href=#825392357001><tt>26 Feb 96 fix@cs ________ question about behavioral lemmas..... </tt></a><li><a href=#825393828001><tt>26 Feb 96 fix@cs ________ More HW9 corrections/clarifications</tt></a><li><a href=#826228482001><tt> 7 Mar 96 ladner@cs _____ Homework 10, problem 1</tt></a><li><a href=#826320874001><tt> 8 Mar 96 ladner@cs _____ Unclaimed homeworks</tt></a><li><a href=#826331590001><tt> 8 Mar 96 fix@cs ________ 322 stuff</tt></a><li><a href=#826574627001><tt>11 Mar 96 ladner@cs _____ Star-Free Expression</tt></a><li><a href=#826599356001><tt>11 Mar 96 fix@cs ________ Office Hours on Tuesday</tt></a><li><a href=#826654872001><tt>12 Mar 96 fix@cs ________ Homework 10</tt></a><li><a href=#826657881001><tt>12 Mar 96 ladner@cs _____ Re: determinism of parsing </tt></a><li><a href=#826825411001><tt>14 Mar 96 ladner@cs _____ Final Exams and Grades</tt></a><li><a href=#827185471001><tt>18 Mar 96 ladner@cs _____ Grading Done</tt></a></ul><pre></pre><hr><h2>Messages</h2><pre><hr size=4><a name="820869253001">To: cse322@csSubject: <b>Book problem</b>Date: Fri, 05 Jan 1996 11:14:09 PSTFrom: <b>Richard Ladner <ladner@whalespout.cs.washington.edu></b></a>Students,For some reason the bookstore removed the old versionsof Sudkamp from the shelf. After talking with them, they agreed to sell the old versionwith the option of exchanging it for the new version ina couple of weeks. You can exchange your old versionwith the new version if you keep your old versionin mint condition.If you have not yet bought a book, you can do so by going to the text book desk and asking for it.Because of the mix up with the book, the assignmentdue tomorrow can be turned in Monday. Richard<hr size=4><a name="820879907001">Date: Fri, 5 Jan 1996 14:11:34 -0800 (PST)From: <b>James Fix <fix@dandelion.cs.washington.edu></b>To: cse322@cs.washington.eduSubject: <b>Welcome to CSE 322</b></a>If you have received this message by email, you are on the emaillist for 322: cse322@cs.washington.edu. If you did NOT receive this message by email (and presumably arereading it on the course web), then you are NOT on the email list. Following usual Internet conventions, administrative requestsconcerning the mailing list itself, such as add/delete/addresschange requests, should be addressed to cse322-request@cs ^^^^^^^^stating your desires. We will use this list for announcements of general interest to theclass. Students should also feel free to use it to ask or answerquestions, post information, or initiate discussions of generalinterest to the class. Of course, questions or comments that don'tseem of general interest can be directed to the TA (fix@cs) orinstructor (ladner@cs), instead. All mail sent to the list is also automatically logged to the courseweb, so you can, for example, scroll back to older messages thatyou didn't save but want to review.Hope you enjoy the course!<hr size=4><a name="821056630001">Date: Sun, 7 Jan 1996 15:17:05 -0800 (PST)From: <b>Grace S Lee <gracelee@grizzly.cs.washington.edu></b>To: James Fix <fix@cs.washington.edu>cc: cse322@grizzly.cs.washington.eduSubject: <b>Re: Welcome to CSE 322</b></a> I don't know if anyone has the same difficulty to get the textbook as I do. I went to the bookstore on Friday, and they already ran out of the books (the wrong one), and I checked in the library yesterday but they didn't have any either. Is it possible to postpone homework for those like me? Thanks.Grace :)*************************************************** University of Washington ** Seattle, WA ** Computer Science ** (Tel) 633-2085 ** gracelee@grizzly.cs.washington.edu ** http://www.cs.washington.edu/homes/gracelee/ ***************************************************<hr size=4><a name="821121656001">To: cse322@csSubject: <b>Student Question</b>Date: Mon, 08 Jan 1996 09:20:52 PSTFrom: <b>Richard Ladner <ladner@whalespout.cs.washington.edu></b></a>Question: Hi. In a lot of the recursive definitions for infinite sets (like natural numbers or something) it says in the closure part that every element in the set has to be obtained through a finite number of applications of the s(n) operation. How can a set be infinite if every element in it is obtained from one element, or a finite number of applications of an operation on that element? SamAnswer:The beauty of an inductive (or recursive) definition is thatan infinite set of objects can be defined from a purelyfinite description (or algorithm). Each object in theinfinite set is "well founded," that is, is built up fromsome basis objects using just a finite number of applicationsof the inductive rules.Why are there an infinite number of objects given bysuch definitions? Basically, because there are an infinitenumber of different ways that objects can be constructed fromthe basis objects.In the simple example of A^*, there is only one basisobject, lambda. A new member can be constructed byconcatenating a member of A to the right of an alreadyexisting member of A^*. If a is in A then we can obtainthe infinite set lambda, a, aa, aaa, aaaa, ... by sucha process.<hr size=4><a name="821125527001">To: cse322@csSubject: <b>Correction in book.</b>Date: Mon, 08 Jan 1996 10:25:20 PSTFrom: <b>Richard Ladner <ladner@whalespout.cs.washington.edu></b></a>As pointed out to me by student Paul Kromann, the thirdand fourth lines in the derivation in example 1.4.1 onpage 15 are missing right parentheses.For example line three should read: = s(s(s(s(s(0))) + 0))In the future, if you find what you suspect is an error in the book, send it to me or Jim for verification andwe will post it to the class.Thanks to Paul for starting this all out.<hr size=4><a name="821208096001">To: cse322@csSubject: <b>Student Question on #12 page 39</b>Date: Tue, 09 Jan 1996 09:21:31 PSTFrom: <b>Richard Ladner <ladner@whalespout.cs.washington.edu></b></a>Question:On #12, does the 'total number of b's and c's is three' mean: a) There are 3 b's and there are three c's or b) The number of b's + number of c's = 3?Thanks!Answer:My reading of this question is b) above.<hr size=4><a name="821337194001">Date: Wed, 10 Jan 1996 21:13:11 -0800 (PST)From: <b>Just like the Lager <sca@wolf.cs.washington.edu></b>To: cse322@wolf.cs.washington.eduSubject: <b>assign# 2</b></a> Does anyone know what 3b is asking for? That just doesn't make any sense to me. Also, does anyone have a good way to check and see if your regular expressions are correct? Thanks.Sam<hr size=4><a name="821387667001">To: cse322@csSubject: <b>Student Question</b>Date: Thu, 11 Jan 1996 11:14:22 PSTFrom: <b>Richard Ladner <ladner@whalespout.cs.washington.edu></b></a>Question: Does anyone know what 3b is asking for? That just doesn't make any sense to me. Also, does anyone have a good way to check and see if your regular expressions are correct? Thanks.SamAnswers:There are two questions:1. Take for example the equation X = {a, \lambda}X \union {\lambda}.One solution is X = {a}^*, but another is, for example,X = {a}^*{b} \union {a}^*. That is, the set equation mayhave more than one solution. In this case, the solutionX = {a}^* is a subset of all other solutions. Your problemis to explain why this is the case more generally.2. How do you check that a regular expression is correct.This can generally be quite hard. This method does notguarantee correctness, but may find errors.Give your expression to a friend or several friends.If they find an error, then simply give a counterexample,that is, either a string not covered by the expression ora string which is in the regular language covered by theexpression but is not in the language.<hr size=4><a name="821392620001">Date: Thu, 11 Jan 1996 12:35:02 -0800 (PST)From: <b>Trent Piepho <xyzzy@u.washington.edu></b>To: cse322@cs.washington.eduSubject: <b>Re: Student Question</b></a>On Thu, 11 Jan 1996, Richard Ladner wrote:> 2. How do you check that a regular expression is correct.> This can generally be quite hard. This method does not> guarantee correctness, but may find errors.You can also use that regex library(s) that are part of most UNIX Clibraries. Do a man regex to see how. It uses a almost identical syntax tothe one we learned in class. You could then type in a load of strings thatshould be in the language and let it check them for you.|Gazing up to the breeze of the heavens \ on a quest, meaning, reason ||came to be, how it begun \ all alone in the family of the sun ||curiosity teasing everyone \ on our home, third stone from the sun. ||Trent Piepho (xyzzy@u.washington.edu) -- Metallica |<hr size=4><a name="821431481001">Date: Thu, 11 Jan 1996 23:24:39 -0800 (PST)From: <b>"M. Mauger" <marcam@u.washington.edu></b>To: cse322@cs.washington.eduSubject: <b>HW#2, prob3</b></a>This is probably too late, but...What the heck does the equation in question 3 mean??X=AX U BAll I can think of is the fact that X must be the same set on both sides of the equation, which means A must be the empty set, and B must be a subset of X. But this makes a) and b) trivial, and doesn't make much sense given the posted discussion on this problem, which I also don't understand much of. For example, an example of the equation is given as: X = {a, /lambda}X U {/lambda}So the element a concacenated with the longest element in X results in a new element NOT in X, making the equation impossible. Of course, I am thinking of this equation ultimately as X = X U B, which is surely wrong. Anyone up this late that can explain this one to me? I would greatly appreciate any help.=========================================================="Bite me. It's fun!" -Crow T Robot==========================================================<hr size=4><a name="821447985001">Date: Fri, 12 Jan 1996 03:59:42 -0800 (PST)From: <b>Alex Chin <alxchin@grizzly.cs.washington.edu></b>To: "M. Mauger" <marcam@u.washington.edu>cc: cse322@cs.washington.eduSubject: <b>Re: HW#2, prob3</b></a> Verify that X = A*B is a solution to the equation by substitution. See if you can make both sides of the equation look identical through a series of identities.On Thu, 11 Jan 1996, M. Mauger wrote:> > This is probably too late, but...> > What the heck does the equation in question 3 mean??> > X=AX U B> > All I can think of is the fact that X must be the same set on both sides > of the equation, which means A must be the empty set, and B must be a > subset of X. But this makes a) and b) trivial, and doesn't make much > sense given the posted discussion on this problem, which I also don't > understand much of. For example, an example of the equation is given as:> X = {a, /lambda}X U {/lambda}> > So the element a concacenated with the longest element in X results in a > new element NOT in X, making the equation impossible. Of course, I am > thinking of this equation ultimately as X = X U B, which is surely > wrong. Anyone up this late that can explain this one to me? I would > greatly appreciate any help.> > > ==========================================================> > "Bite me. It's fun!"> -Crow T Robot> > ==========================================================> > <hr size=4><a name="821468642001">To: cse322@cscc: marcam@u.washington.eduSubject: <b>Re: HW#2, prob3 </b>In-reply-to: Your message of "Thu, 11 Jan 1996 23:24:39 PST." <Pine.A32.3.91j.960111232351.136204A-100000@homer28.u.washington.edu> Date: Fri, 12 Jan 1996 09:43:57 PSTFrom: <b>Richard Ladner <ladner@whalespout.cs.washington.edu></b></a>Question:What the heck does the equation in question 3 mean??X=AX U BAll I can think of is the fact that X must be the same set on both sides of the equation, which means A must be the empty set, and B must be a subset of X. But this makes a) and b) trivial, and doesn't make much sense given the posted discussion on this problem, which I also don't understand much of. For example, an example of the equation is given as: X = {a, /lambda}X U {/lambda}So the element a concacenated with the longest element in X results in a new element NOT in X, making the equation impossible. Of course, I am thinking of this equation ultimately as X = X U B, which is surely wrong. Anyone up this late that can explain this one to me? I would greatly appreciate any help.Answer:⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?