Contents (hide)

Welcome to Automata and Formal Languages homepage

This site is dedicated to Automata and Formal Languages, 2013 course.

Be sure to read the Announcements page regularly .

You can also see the last updated pages by using the recent changes link on the left side tab.

Contact information

You can find the staff's office hours and contact info here.

For any administrative issue please contact the course staff at ; do not use our private mail for that purpose.

Text Books

1. J. Martin, Introduction to Languages and the Theory of Computation, 2nd ed., McGraw-Hill.
2. T.A. Sudkamp, Languages and Machines, 2nd ed., Addison-Wesley.
3. H.R. Lewis and C.H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall.
4. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley.
5. D. Wood, Theory of Computation, Wiley.
6. D.I.A. Cohen, Introduction to Computer Theory, 2nd ed., Wiley.
7. M. Sipser, Introduction to Theory of Computation.
8. Kozen, Automata And Computability.
9.
אוטומטים ושפות פורמליות / כותבים: שמואל זקס, נסים פרנסיז ; עריכה: בת- שבע כהן ; איורים: אתי זינגר, רונית בורלא
(Doesn't necessarily includes all the course material)

Academic Integrity

Cheating in university courses is regarded as a serious offense. To avoid any possible misunderstanding, please read the following carefully.

Academic dishonesty includes any act of obtaining, soliciting or making available to others, material related to homework assignments. If you commit any of the above, then you are guilty of academic dishonesty. If your partner commits any of the above and you submit the assignment jointly, then you are just as guilty of academic dishonesty. If you choose to work with a partner, then you are both personally responsible for what you submit together. Claiming that you were not aware of the fact that your partner copied the assignment from somebody else will not absolve you of any responsibility.

To eliminate any doubts, we make no distinction between the two (or more) sides of the cheating. If we suspect that Bob and Alice have copied an exercise one from the other, we see no way they could have done this without cooperation. It is your own responsibility to make sure that nobody can copy your assignment.

We will not tolerate academic dishonesty in this course. If you are suspected of academic dishonesty, then a complaint will be filed with the university disciplinary board (ועדת משמעת) and a detailed report placed in your academic records. The minimal penalty for this type of offense is a grade of zero in the course. You might also be expelled from the university.

Be aware that publishing the assignment solution in the internet before the deadline is a serious violation of the academic integrity. Please avoid that.

We reserve the right to check for academic dishonesty anytime after you have submitted an assignment.

Grading Policy

The final grade will be based on the following (all mandatory):

  • Homework - Six home assignments - 15%. the grade will be based on the best 5 grades.
    Assignments policy:
    You must get a grade of at least 40 on each of your best 5 assignments.
    A student that will fail to achieve the above minimal grades will be graded 0 on the assignment component of the course grade!
    (-15 pts on the final grade)

    Please read carefully the instructions on the Assignments page.


  • Midterm - 15-20% - will be held on 29.11.12, 17:30.
  • Final Exam - 65-70%. Moed A - 03.02.2013, Moed B - 25.02.2012.

    The final combined grade of the midterm and exam in your final grade (85%) will be calculated through the following formula: Let f be your final exam grade and m be your midterm grade. Your combined grade will be: g = Max{(0.15*m+0.7*f),(0.2*m+0.65*f)}

    The rounded value of g/0.85 must be greater or equal to 56 for passing the course.
    In case the rounded combined grade is <56 then your final grade is will be your rounded combined grade.

.