Курсы » Theory of Computation »

9, Авг 2009

Второй курс, посвященный теоретическому аспекту информатики.

Раздел в вики, посвященный этому курсу. Содержание курса:

  • Overview
  • Deterministic finite automata: definition and examples
  • Regular operations
  • Examples of nondeterministic finite automata
  • Definition of nondeterministic finite automata; equivalence of deterministic and nondeterministic finite automata
  • Equivalence of deterministic and nondeterministic finite automata; closure under the regular operations
  • Closure under the regular operations; regular expressions
  • How to convert a regular expression to an NFA; how to convert a DFA to a regular expression
9, Авг 2009

Introduction to Theory of Computation
(COMP2805)

Anil Maheshwari & Michiel Smid
School of Computer Science
Carleton University
E-mail: {anil,michiel}@scs.carleton.ca

(Читать полностью)

2, Авг 2009

1, Авг 2009

Midterm-экзамен по предмету COMP2805. Скачать.



Warning: Parameter 1 to id_generic_callback() expected to be a reference, value given in /home/users/f/freetonik/domains/css.freetonik.com/wp-content/plugins/intensedebate/intensedebate.php on line 911

Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 8653350 bytes) in /home/users/f/freetonik/domains/css.freetonik.com/wp-includes/functions.php on line 959