Measuring Information in Timed Languages
Timed automata and timed languages  constitute a beautiful discovery that opened new perspectives to automata and language theory, as well as new applications to computer-aided verification. However the theory of timed regular languages is far from being achieved. Seven years ago, in , I argued that developing such a theory constituted an important research challenge, and I sketched a research program in this direction. Unfortunately, when listing research tasks on timed languages I have overlooked one interesting topic: measuring size of and information content in such languages. Catching up this omission became the focus of my research and the theme of this talk.
KeywordsInformation Content Volume Versus Size Measure Spectral Radius Formal Language
- 5.Asarin, E., Degorre, A.: Two size measures for timed languages. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS. LIPIcs, vol. 8, pp. 376–387. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)Google Scholar
- 6.Basset, N.: Dynamique Symbolique et Langages Temporisés. Master’s thesis, Master Parisien de la Recherche Informatique (2010)Google Scholar