More details soon

The topic of the internships would be either the model of vector addition systems (VAS) or weighted automata. The project would require mathematical skills and basic knowledge of theoretical computer science (automata, regular languages). One can think that weighted automata are a generalisation of linear recursive sequences (LRS). For example the Fibonacci sequence F_{n+2} = F_{n+1} + F_n is an LRS. If sequences define functions f : N -> Q then weighted automata define functions A : Sigma^* -> Q.

An example decision problem we would like to consider is boundendess: given a weighted automaton decide whether there exist a sequences of words w_0, w_1,..., such that lim(A(w_0)) = infinity.