A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Entropy of regular timed languages
2015
Information and Computation
For timed languages, we define size measures: volume for languages with a fixed finite number of events, and entropy (growth rate) as asymptotic measure for an unbounded number of events. These measures can be used for quantitative comparison of languages, and the entropy can be viewed as information contents of a timed language. For languages accepted by deterministic timed automata, we give exact formulas for volumes. We show that automata with non-vanishing entropy ("thick") have a normal
doi:10.1016/j.ic.2015.03.003
fatcat:dayj6uf3w5clndhg64fol2xs54