Stability Pact - European Commission - DAAD
Project: "Centre of Excellence for Applications of Mathematics"



South-West University "Neofit Rilski",
Blagoevgrad, BULGARIA
Tel. + 359 /73/ 88 55 01, Fax: + 359 /73/ 88 55 16,
E-mail: shtrakov@swu.bg



Intensive Course on Application of Algebra
and Discrete Mathematics in Computer Science

Blagoevgrad, 24.10.2005-02.11.2005

Organizer and host Objectives Program

Lecturers

Participants

Photo gallery

Organizer and host

The Intensive course was hosted by the South-West University, Blagoevgrad, Bulgaria. It took place in the frame of the project "Center of Excellence for Applications of Mathematics" and financial support was given by DAAD (German Academic Exchange Service) / Stability Pact for South Eastern Europe. The course is organized by the South-West University with coordinator of the project Assoc. Prof. Slavcho Shtrakov.

top of page


Lecturers

Prof.Dr.Hc. Klaus Denecke, Institut fur Mathematik, Universitat Potsdam, Germany Prof. Dr. Jorg Koppitz, Institut fur Mathematik, Universitat Potsdam, Germany
kdenecke@rz.uni-potsdam.de koppitz@rz.uni-potsdam.de
Tel: +49-(0)331/977-1415 Tel: +49-(0)331/977-1060

top of page


Participants

SERBIA, NIS SERBIA, NOVI SAD
Dejan Mancev
MACEDONIA, SKOPJE BULGARIA, PLOVDIV
BOSNIA and HERZEGOVINA, SRAJEVO BULGARIA, BLAGOEVGRAD
Dimitrina Tzvetkova
Strahil Shorgov
BULGARIA, SOFIA

top of page


Program

I. State-based systems
  1. Black boxes.
  2. Functional programming.
  3. Data types.
  4. Automata and Languages.
  5. Object-oriented programs.
  6. Non-deterministic systems.
  7. The concept of a coalgebra.
II. Basic concepts from category theory
  1. The concept of a category.
  2. Special morphisms.
  3. Terminal objects, sums, pushouts.
  4. The category Set.
  5. Functors.
  6. Natural transformations.
III. Coalgebras
  1. Substructures.
  2. Homomorphic images, factorizations.
  3. Colimits in setF.
  4. Bisimulation.
  5. Epis and Monos in SetF.
  6. Congruences.
  7. Covarieties
IV. Terminal Coalgebras
  1. Terminal automata.
  2. Existence of terminal coalgebras.
  3. Weakly terminal coalgebras.
  4. Restricted functors.
  5. Cofree coalgebras.
  6. Pattern-defined classes as covarieties.
  7. Programming with terminal coalgebras.
  8. Proofs by coinduction.

top of page


Objectives

The main goal and target of the Intensive course "Application of Algebra and Discrete Mathematics in Computer Science" is to give an opportunity for students, postdocs or young researchers from the partner universities in the South Eastern Europe to create good relationships and to help them in their research. Next goal of the course is to demonstrate the flexibility to application in Computer Science of a traditional field of mathematics as algebra and discrete mathematics.

Our countries could benefit a lot, if we can continue the cooperation between these young people, started with this course.

The programme of the course provide many examples for application of some classical topics of algebra in computer science as:

top of page


Links

  • South-West University, Blagoevgrad
  • Institut fur Mathematik, Universitat Potsdam
  • Bulgarian Academy of Sciences
  • IMI of BAS
  • top of page


    last change 09 November 2005

    shtrakov@aix.swu.bg