Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdulla, P.A., Krcal, P., Yi, W.: R-automata. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 67–81. Springer, Heidelberg (2008)
Bala, S.: Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 596–607. Springer, Heidelberg (2004)
Blumensath, A., Otto, M., Weyer, M.: Boundedness of monadic second-order formulae over finite words. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 67–78. Springer, Heidelberg (2009)
Bojańczyk, M., Colcombet, T.: Bounds in ω-regularity. In: LICS, pp. 285–296. IEEE Computer Society Press, Los Alamitos (2006)
Colcombet, T.: Regular cost functions over words. Manuscript available online (2009)
Colcombet, T.: Regular cost functions, part i: logic and algebra over words (2009) (Submitted)
Colcombet, T.: The theory of stabilization monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 139–150. Springer, Heidelberg (2009)
Eggan, L.C.: Transition graphs and the star-height of regular events. Michigan Math. J. 10, 385–397 (1963)
Hashiguchi, K.: A decision procedure for the order of regular events. Theor. Comput. Sci. 8, 69–72 (1979)
Hashiguchi, K.: Relative star height, star height and finite automata with distance functions. In: Pin, J.E. (ed.) LITP 1988. LNCS, vol. 386, pp. 74–88. Springer, Heidelberg (1989)
Kirsten, D.: Desert automata and the finite substitution problem. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 305–316. Springer, Heidelberg (2004)
Kirsten, D.: Distance desert automata and the star height problem. ITA - RAIRO 3(39), 455–509 (2005)
Schützenberger, M.-P.: On finite monoids having only trivial subgroups. Information and Control 8, 190–194 (1965)
Simon, I.: Limited subsets of a free monoid. In: FOCS, pp. 143–150 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colcombet, T., Kuperberg, D., Lombardy, S. (2010). Regular Temporal Cost Functions. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-14162-1_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14161-4
Online ISBN: 978-3-642-14162-1
eBook Packages: Computer ScienceComputer Science (R0)