Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
An algebraic approach to data languages and timed languages
Information and Computation
Volume and Entropy of Regular Timed Languages: Discretization Approach
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
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
Codes and Automata (Encyclopedia of Mathematics and its Applications)
Codes and Automata (Encyclopedia of Mathematics and its Applications)
Thin and thick timed regular languages
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
EFMplus: the coding format of the multimedia compact disc
IEEE Transactions on Consumer Electronics
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 |
The classical theory of constrained-channel coding deals with the following questions: given two languages representing a source and a channel, is it possible to encode source messages to channel messages, and how to realize encoding and decoding by simple algorithms, most often transducers. The answers to this kind of questions are based on the notion of entropy. In the current paper, the questions and the results of the classical theory are lifted to timed languages. Using the notion of entropy of timed languages introduced by Asarin and Degorre, the question of timed coding is stated and solved in several settings.