Concurrent finite automata

Prelegent(ci)

prof. Manfred Kudlek

Afiliacja

Uniwersytet w Hamburgu

Termin

2 października 2009 15:00

Pokój

p. 5820

Seminarium

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.

---