TY - GEN
T1 - Size-Change Abstraction and Max-Plus Automata
AU - Colcombet, Thomas
AU - Daviaud, Laure
AU - Zuleger, Florian
N1 - 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
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84958537827&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-44522-8_18
DO - 10.1007/978-3-662-44522-8_18
M3 - Conference contribution
AN - SCOPUS:84958537827
SN - 978-3-662-44521-1
T3 - Lecture Notes in Computer Science
SP - 208
EP - 219
BT - MFCS 2014: Mathematical Foundations of Computer Science 2014
A2 - Csuhaj-Varjú, Erzsébet
A2 - Dietzfelbinger, Martin
A2 - Ésik, Zoltán
PB - Springer-Verlag Berlin Heidelberg
T2 - 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
Y2 - 25 August 2014 through 29 August 2014
ER -