Regular Temporal Cost Functions

Thomas Colcombet (1) , Denis Kuperberg (1) , Sylvain Lombardy (2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities. The specificity of cost functions is that exact values are not considered, but only estimated. In this paper, we study the strict subclass of regular temporal cost functions. In such cost functions, it is only allowed to count the number of occurrences of consecutive events. For this reason, this model intends to measure the length of intervals, i.e., a discrete notion of time. We provide various equivalent representations for functions in this class, using automata, and 'clock based' reduction to regular languages. We show that the conversions are much simpler to obtain, and much more efficient than in the general case of regular cost functions. Our second aim in this paper is to use temporal cost function as a test-case for exploring the algebraic nature of regular cost functions. Following the seminal ideas of Schützenberger, this results in a decidable algebraic characterization of regular temporal cost functions inside the class of regular cost functions.

Domaines: Algorithme et structure de données [cs.DS]

Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy. Regular Temporal Cost Functions. International Colloquium on Automata, Languages and Programming (ICALP), 2010, Bordeaux, France. pp.563-574. ⟨hal-00859355⟩