Johann A. Makowsky
Characterizing word functions recognized by weighted automata
VCLA will be hosting a talk by Johann A. Makowsky on June 26th, 2013.
|DATE:||Wednesday, June 26, 2013|
|VENUE:||von Neumann seminar room|
Weighted automata were studied under different names (probabilitic automata, multiplicity automata) since the very beginning of automata theory. They regognize word functions with values in a commutative semiring. We give a new characteriziation of functions regognized by weighted automata, and compare our results to various other such characterizations.
Joint work with N. Labai.
To appear in GandALF 2013.