You are not logged in | Log in

Concurrent finite automata

Speaker(s)
prof. Manfred Kudlek
Affiliation
Uniwersytet w Hamburgu
Date
Oct. 2, 2009, 3 p.m.
Room
room 5820
Seminar
Seminarium badawcze Zakładu Logiki: Wnioskowania aproksymacyjne w eksploracji danych

1. Concurrent finite automata. Replacing the control of a(n)(finite) automaton by a Petri net one can define new word language classes. The relation between each and to other language classes is presented. 2. De computo paschae. It is shown how Easter was and is computed. For that some historical and the present two methods for the Orthodox and Western churches is given.