Welcome

Tel-Aviv University
School of Computer Science
Computational Models (or more accurately, Introduction to the Theory of Computation)
0368.2200
Spring Semester 2010

News

Overlap resolved

Recitation group 13 (Wed 14-15) rescheduled just after Computer Structure (Wed 17-18).

We managed to reschedule one of the Wednesday recitations, saving you the need to be in more than one place in the same time.
(Or, as the case seems to be in Thursday recitations, the need of more than one of you to occupy one seat in the same time…)

See the new hours and location in the Course Schedule page.


(1268137627|%e %b %Y, %H:%M %Z|agohover)

Location of recitation has changed

Thu 12-13 recitation has moved to Orenstein 103 Thu 14-15 recitation has moved to Dan-David 001

Hi all,
As you know Thu recitations are packed and we are trying to figure out a solution.

As a first step the venue of the recitation has changed:
We will meet on Thursdays between 12-13 in Orenstein 103 and between 14-15 in Dan-David 001. So please spread the rumor among your friends so people don't accidentally go to Shenkar 104.

However, although the classroom will be bigger, we strongly encourage you to try and attend the recitations on Wednesdays. Currently the consequence of this imbalance is that the recitation on Thu is much slower than the one on Wed. However, both groups will have the same exam at the end of the semester. So it is in your best interest to try and even things out.

Thanks.


(1267976883|%e %b %Y, %H:%M %Z|agohover)

Extension for HW #1

You got three more days.

Although you're all smart and can come up with the answers yourselves, a couple of exercises that we'll solve in the upcoming recitation will facilitate question 4. Thus, the due date of HW #1 was postponed until Sunday, March 14.

FYI, we're still working on rescheduling Wednesday recitations; so far the plausible solution seems to be moving one of the groups to 17-18.
If this change will render some of you unable to attend any of the four recitations, please say so.


(1267816638|%e %b %Y, %H:%M %Z|agohover)

Comp. Models vs. Comp. Structure

Dealing with the overlap between Rani's recitations and the Computer Structure lecture.

Some of you informed us that recitation groups 12 and 13 (on Wednesday) overlap the lecture in Computer Structure.
We would like to amend this, probably by rescheduling one or both of the recitations.

Stay tuned for further developments.


(1267370801|%e %b %Y, %H:%M %Z|agohover)

Wilkommen, Bienvenue, Welcome!

Oh, yes, and get exercise 1 while you're here.

Thank you for joining us in this lovely new semester.

Exercise 1 is published, please find it in the home assignments page.


(1266830045|%e %b %Y, %H:%M %Z|agohover)

rss icon RSS feed

Recent Forum Posts

ex1 q2.b`: Re: ex1 q2.b`

By benny_chor on 1267991389|%e %b %Y, %H:%M %Z|agohover
Both x can contain both a's and b's. The same goes for y.

ex1 q2.b`: ex1 q2.b`

By zigi on 1267984362|%e %b %Y, %H:%M %Z|agohover
does X contain only "a" characters, or both "a" and "b" characters? and Y accordingly.. thx!

זה בסדר שלא עברנו בתרגול על ביטויים רגולריים ורק בהרצאה?: Re: זה בסדר שלא עברנו בתרגול על ביטויים רגולריים ורק בהרצאה?

By Jonathancito on 1267977993|%e %b %Y, %H:%M %Z|agohover
In any case, since we have a 1-hour recitation we do not attempt to cover the entire lecture, but try and prioritize the best of our abilities You can expect (also in the future) to have HW questions about things that were covered in the lecture but not in the recitation.

זה בסדר שלא עברנו בתרגול על ביטויים רגולריים ורק בהרצאה?: Re: זה בסדר שלא עברנו בתרגול על ביטויים רגולריים ורק בהרצאה?

By RaeNye on 1267977101|%e %b %Y, %H:%M %Z|agohover
בתרגול שלנו לא היה… It was the regexp of (binary words beginning in zero or ending in one). I devoted 20 seconds to it, maybe you blinked :)

Question 4 - Ex1: Re: Question 4 - Ex1

By benny_chor on 1267896627|%e %b %Y, %H:%M %Z|agohover
In 4a the and are strings (elements of ). In 4b each and are single letters. By concatenating them, you get a string.

DFA/NFA's number of states: Re: DFA/NFA's number of states

By benny_chor on 1267895900|%e %b %Y, %H:%M %Z|agohover
We did not require it to be minimal, but still, it should be reasonable. So, for example, if the minimal automaton has 7 states and yours has 8, no problem. But if yours has 19 states, you may lose some points.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License