@inproceedings{10.1007/978-3-642-28332-1_1,
Abstract = {Timed automata and timed languages [1] 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 [2], 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.},
Address = {Berlin, Heidelberg},
Author = {Asarin, Eugene},
BookTitle = {Language and Automata Theory and Applications},
Editor = {Dediu, Adrian-Horia and Mart{\'\i}n-Vide, Carlos},
File = {Measuring Information in Timed Languages - Asarin2012\_Chapter\_MeasuringInformationInTimedLan - a - f.pdf},
ISBN = {978-3-642-28332-1},
Pages = {1--2},
Publisher = {Springer Berlin Heidelberg},
Title = {Measuring Information in Timed Languages},
Year = {2012},
date-added = {2020-10-21 14:54:22 +0200},
date-modified = {2020-10-21 14:54:22 +0200},
doi = {10.1007/978-3-642-28332-1_1}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A