mpla.math.uoa.gr
Font size: Αα Αα Αα hide gadgets
You are here: Courses » 2005-2006 » spring semester » Π05Β. Computation Models, Formal Languages, Automata Theory and Complexity (2005-2006, spring semester)

Computation Models, Formal Languages, Automata Theory and Complexity: 2005-2006, spring semester

This is a course that has been given 10 times. For information about this course in general (not just for this specific semester), visit its page: Π05Β. Computation models and complexity.

Taught by: Efstathios Zachos

Teaching hours

We apologize, but we cannot remember the weekly schedule of this course.

Comments

You must be logged in to comment.

Reporter

Web standards: XHTML1.0, CSS3.
© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.