Rational and recognisable power series - IMT - Institut Mines-Télécom Accéder directement au contenu
Chapitre D'ouvrage Année : 2009

Rational and recognisable power series

Résumé

This chapter presents the theory of weighted automata over graded monoids and with weights taken in arbitrary semirings. The first benefit of broadening the scope beyond free monoids is that it makes clearer the distinction between the rational and the recognisable series. As the topological machinery is set anyway, the star of series is defined in a slightly more general setting than cycle-free series. The main subjects covered in the chapter are then: the notion of covering of automata (also called bisimulation by some authors) and its relationship with the conjugacy of automata; the closure of recognisable series by Hadamard and shuffle products; the derivation of weighted rational expressions over a free monoid; the reduction theory of series over a free monoid and with weights in a (skew) field, that leads to a procedure for the decidability of equivalence (with a cubic complexity); and the basics for a theory of weighted rational relations. As a result, this chapter, among other things, lays the bases for the proof of the decidability of the equivalence of deterministic k-tape transducers which is one of the most striking examples of the application of algebra to ‘machine theory’.
Fichier non déposé

Dates et versions

hal-00479545 , version 1 (30-04-2010)

Identifiants

Citer

J. Sakarovitch. Rational and recognisable power series. Handbook of Weighted Automata (M. Droste, W. Kuich and H. Vogler, Eds.), Springer, pp.105-174, 2009, 978-3-642-01491-8. ⟨10.1007/978-3-642-01492-5_4⟩. ⟨hal-00479545⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More