Jelenlegi hely

Szeminárium helyszín változás

Tisztelt Kollegak!

Az Informatikai Tanszekcsoport holnapi (szept. 25) szeminariumanak
helyszine modosult!

14.00 es 15.00 kozott az

Irinyi epulet 221-es termeben lesz a szeminarium.

A szeminarium eloadoja, az eloadas cime es absztraktja a kovetkezo:

Jacques Sakarovitch
(CNRS / Telecom ParisTech)

On the weighted closure problem

In this talk, I will address the problem of \eps-transition removal in
weighted automata that was raised in particular by the writing of the
modules for Q- and R-automata for the Vaucanson platform.

From an elementary, always solvable and well-treated, question in the
Boolean case, the same problem becomes in the most general case one that
may have no solution. Almost all earlier works on weighted automata rule
out automata in which such removal leads to infinite summation.
We give here a framework that is rigorous enough for the computation and
decision algorithms be well-founded, but large enough to encompass all
the ‘natural’ cases of weighted automata. The setting of this framework
has lead to a new characterisation of the conditions under which the
behaviour of a weighted automaton is defined.

Joint work with Sylvain Lombardy

Az eloadasra minden erdeklodot szeretettel varunk.

A szeminarium szervezoi