Skip to Main content Skip to Navigation

Expressivité des automates pondérés circulaires et boustrophédons

Abstract : This thesis deals with some extensions of weighted automata,and studies the series they can realisedepending on the nature of their weigths.These extensions are characterised by howthe input head of the automaton is allowed to move:rotating automata can go back at the beginning of the word,and two-way automata can change the reading direction.In the general setting, weigthed rotating automata are morepowerful than classical one-way automata, and less powerfulthan two-way ones.Moreover, we introduce Hadamard expressions,which are an extension of rational expressions and can denotethe behaviour of rotating automata.The algorithms for this conversion are studied when the weights belong toa rationally additive semiring.Then, rotating automata are shown as expressive as two-way automatain the case of rational, real or complex numbers.It is also proved that two-way and one-way automataare equivalent when weighted on a locally finite bimonoid.
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Wednesday, November 6, 2019 - 10:01:17 AM
Last modification on : Thursday, March 5, 2020 - 3:26:38 PM
Long-term archiving on: : Friday, February 7, 2020 - 6:31:09 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02350722, version 1



Louis-Marie Dando. Expressivité des automates pondérés circulaires et boustrophédons. Langage de programmation [cs.PL]. Université de Bordeaux, 2019. Français. ⟨NNT : 2019BORD0130⟩. ⟨tel-02350722⟩



Record views


Files downloads