Size-Change Abstraction and Max-Plus Automata

Colcombet, Thomas, Daviaud, Laure and Zuleger, Florian (2014) Size-Change Abstraction and Max-Plus Automata. In: MFCS 2014: Mathematical Foundations of Computer Science 2014. Lecture Notes in Computer Science . Springer-Verlag Berlin Heidelberg, HUN, pp. 208-219. ISBN 978-3-662-44521-1

Full text not available from this repository.


Max-plus automata (over N∩{-∞) are finite devices that map input words to non-negative integers or -∞. In this paper we present (a) an algorithm allowing to compute the asymptotic behaviour of max-plus automata, and (b) an application of this technique to the evaluation of the computational time complexity of programs.

Item Type: Book Section
Additional Information: Funding Information: The research leading to these results has received funding from the European Union’s Seventh Framework Programme (FP7/2007-2013) under grant agreement n259454 and from the Vienna Science and Technology Fund (WWTF) through grant ICT12-059. o
Uncontrolled Keywords: theoretical computer science,computer science(all) ,/dk/atira/pure/subjectarea/asjc/2600/2614
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 08 Jun 2023 13:30
Last Modified: 08 Jun 2023 13:30
DOI: 10.1007/978-3-662-44522-8_18

Actions (login required)

View Item View Item