| ReDCAD laboratory | ENIS | FSEGS | University of Sfax | | My vCard |
| Research Laboratory on Development and Control of Distributed Applications | |
| ReDCAD laboratory | ENIS | FSEGS | University of Sfax | | My vCard |
| Research Laboratory on Development and Control of Distributed Applications | |
Program Committee Member of:
My research focus on publications in Theoretical Computer Science. It consists of some contributions of the theory of automata with multiplicities. This structure has many applications to connected sciences (Computer Sciences, Mathematics, Physics, etc). A particular type of automata with multiplicities is the automaton with epsilon-transitions denoted by k-epsilon-automaton. In the first part, we give an algebraic method for removing the epsilon-transitions of the k-epsilon -automaton in order to obtain an equivalent k automaton with the same behaviour. We discuss two aspects of the star problem (by infinite sums and by equations). The theory of minimization allows to minimize a k-automaton in the sense of reducing to the smallest among the number of states. It can be used with some modification to solve other problems such as the splitting of modules. We have used the algorithm of decomposition to split a Boolean function which constitute the non-linear element of the cryptographic algorithm and to split a A-module where A is the Hecke algebra as \(q=0\). These algorithms are added to the library MuPAD-combinat.