Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Journal of the ACM (JACM)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Discretization of Delays in Timed Automata and Digital Circuits
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Introducing Probability within State Class Analysis of Dense-Time-Dependent Systems
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
On timed components and their abstraction
Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Computability and information in models of randomness and chaos†
Mathematical Structures in Computer Science
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
An Introduction to Kolmogorov Complexity and Its Applications
An Introduction to Kolmogorov Complexity and Its Applications
Volume and Entropy of Regular Timed Languages: Analytic Approach
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Volume and Entropy of Regular Timed Languages: Analytic Approach
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Emptiness and universality problems in timed automata with positive frequency
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Thin and thick timed regular languages
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
A linearly computable measure of string complexity
Theoretical Computer Science
Measuring information in timed languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Generating functions of timed languages
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Toward a timed theory of channel coding
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
A maximal entropy stochastic process for a timed automaton,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Spectral gap in timed automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
For timed languages, we define size measures: volume for languages with words having 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 the information contents of a timed language. For languages accepted by deterministic timed automata, we give exact formulas for volumes. Next, for a large class of timed languages accepted by non-Zeno timed automata, we devise a method to approximate the volumes and the entropy based on discretization. We give an information-theoretic interpretation of the entropy in terms of Kolmogorov complexity.