{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:34Z","timestamp":1725483754579},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_50","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"549-558","source":"Crossref","is-referenced-by-count":0,"title":["Bilinear Functions and Trees over the (max, +) Semiring"],"prefix":"10.1007","author":[{"given":"Sabrina","family":"Mantaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent D.","family":"Blondel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Mairesse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"50_CR1","volume-title":"Synchronization and Linearity","author":"F. Baccelli","year":"1992","unstructured":"F. Baccelli, G. Cohen, G.J. Olsder, and J.P. Quadrat. Synchronization and Linearity. John Wiley & Sons, New York, 1992."},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J. Berstel","year":"1982","unstructured":"J. Berstel and C. Reutenauer. Recognizable formal power series on trees. Theoretical Computer Science, 18:115\u2013148, 1982.","journal-title":"Theoretical Computer Science"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"J. Berstel and C. Reutenauer. Rational Series and their Languages. Springer Verlag, 1988.","DOI":"10.1007\/978-3-642-73235-5"},{"issue":"3","key":"50_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(90)90169-I","volume":"77","author":"S. Bozapalidis","year":"1990","unstructured":"S. Bozapalidis. Constructions effectives sur les s\u00e9ries formelles d\u2019arbres. Theoretical Computer Science, 77(3):237\u2013247, 1990.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"50_CR5","first-page":"165","volume":"1","author":"S. Bozapalidis","year":"1996","unstructured":"S. Bozapalidis. Convex algebras, convex modules and formal power series on trees. Autom. Lang. Comb. 1(3):165\u2013180, 1996.","journal-title":"Autom. Lang. Comb."},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TAC.1985.1103925","volume":"30","author":"G. Cohen","year":"1985","unstructured":"G. Cohen, D. Dubois, J.P. Quadrat, and M. Viot. A linear system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. IEEE Trans. Automatic Control, 30:210\u2013220, 1985.","journal-title":"IEEE Trans. Automatic Control"},{"key":"50_CR7","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata , 1997."},{"key":"50_CR8","unstructured":"J.H. Conway. Regular algebra and finite machines. Chapman and Hall, 1971."},{"key":"50_CR9","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48708-8","volume-title":"Minimax Algebra","author":"R. Cuninghame-Green","year":"1979","unstructured":"R. Cuninghame-Green. Minimax Algebra, volume166 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 1979."},{"key":"50_CR10","unstructured":"S. Gaubert. On rational series in one variable over certain dioids. Technical Report 2162, INRIA, 1994."},{"key":"50_CR11","unstructured":"S. Gaubert. Personal communication, 1998."},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"S. Gaubert and J. Mairesse. Task resource models and (max,+) automata. In J. Gunawardena, (editor), Idempotency, volume 11, pages 133\u2013144. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9780511662508.009"},{"issue":"4","key":"50_CR13","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/9.754807","volume":"44","author":"S. Gaubert","year":"1999","unstructured":"S. Gaubert and J. Mairesse. Modeling and analysis of timed Petri nets using heaps of pieces. IEEE Trans. Aut. Cont., 44(4):683\u2013698, 1999.","journal-title":"IEEE Trans. Aut. Cont."},{"key":"50_CR14","unstructured":"M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons, 1986."},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"J. Gunawardena, (editor). Idempotency. Publications of the Newton Institute. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9780511662508"},{"key":"50_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashigushi","year":"1982","unstructured":"K. Hashigushi. Limitedness theorem on finite automata with distance functions. J. Computer System Sci., 24:233\u2013244, 1982.","journal-title":"J. Computer System Sci."},{"issue":"3","key":"50_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S0218196794000063","volume":"4","author":"D. Krob","year":"1994","unstructured":"D. Krob. The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. of Algebra and Computation, 4(3):405\u2013425, 1994.","journal-title":"Int. J. of Algebra and Computation"},{"key":"50_CR18","doi-asserted-by":"crossref","unstructured":"W. Kuich and A. Salomaa. Semirings, Automata, Languages. Springer, 1986.","DOI":"10.1007\/978-3-642-69959-7"},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"V. Maslov and S. Samborskii, (editors). Idempotent Analysis, volume 13 of Adv. in Sov. Math. AMS, 1992.","DOI":"10.1090\/advsov\/013"},{"key":"50_CR20","unstructured":"M. Nivat. Binary tree codes. In Tree automata and languages, pages 1\u201319. Elsevier, 1992."},{"key":"50_CR21","doi-asserted-by":"crossref","unstructured":"J.E. Pin. Tropical semirings. In J. Gunawardena, (editor), Idempotency, pages 50\u201369. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9780511662508.004"},{"key":"50_CR22","first-page":"384","volume-title":"Mots, M\u00e9langes offerts \u00e1 M.P. Sch\u00fctzenberger","author":"I. Simon","year":"1990","unstructured":"I. Simon. The nondeterministic complexity of a finite automaton. In M. Lothaire, (editor), Mots, M\u00e9langes offerts \u00e1 M.P. Sch\u00fctzenberger, pages 384\u2013400. Hermes, Paris, 1990."},{"key":"50_CR23","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. Van Leeuwen, (editor), Handbook of Theoretical Computer Science, Volume B, pages 133\u2013192. Elsevier and MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"50_CR24","unstructured":"G.X. Viennot. Trees. In M. Lothaire, (editor), Mots, pages 265\u2013297, Paris, 1990. Herm\u00e9s."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:41:36Z","timestamp":1556376096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_50","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}