Back to Search Start Over

Bilinear functions and trees over the (max,+) semiring

Authors :
Vincent D. Blondel
Jean Mairesse
Sabrina Mantaci
Mairesse, Jean
Springer-Verlag
Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA)
Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)
Pôle en ingénierie mathématique (INMA)
Université Catholique de Louvain = Catholic University of Louvain (UCL)
Source :
Proceedings of MFCS, MFCS 2000, MFCS 2000, 2000, Bratislava, Slovakia. pp.549-558, Lecture Notes in Computer Science ISBN: 9783540679011, MFCS
Publication Year :
2000
Publisher :
HAL CCSD, 2000.

Abstract

We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (max, +). In this semiring, a fundamental result associates the asymptotic behaviour of the iterates of a linear function with the maximal average weight of the circuits in a graph naturally associated with the function. Here we provide an analog for the 'iterates' of bilinear functions. We also give a triple recognizing the formal power series of the worst case behaviour. Remark. Due to space limitations, the proofs have been omitted. A full version can be obtained from the authors on request.

Details

Language :
English
ISBN :
978-3-540-67901-1
ISBNs :
9783540679011
Database :
OpenAIRE
Journal :
Proceedings of MFCS, MFCS 2000, MFCS 2000, 2000, Bratislava, Slovakia. pp.549-558, Lecture Notes in Computer Science ISBN: 9783540679011, MFCS
Accession number :
edsair.doi.dedup.....65286eece920dfa9f5134b5af7cc66ec