Volume and Entropy of Regular Timed Languages: Discretization Approach

DOI10.1007/978-3-642-04081-8_6zbMath1254.68128OpenAlexW1497455647MaRDI QIDQ3184666

Eugene Asarin, Aldric Degorre

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (13)

Lossiness of communication channels modeled by transducers1 ⋮ Thin and Thick Timed Regular Languages ⋮ Quantifying communication in synchronized languages ⋮ Quantifying Communication in Synchronized Languages ⋮ Information rate of some classes of non-regular languages: an automata-theoretic approach ⋮ Timed Symbolic Dynamics ⋮ Execution information rate for some classes of automata ⋮ A linearly computable measure of string complexity ⋮ Emptiness and Universality Problems in Timed Automata with Positive Frequency ⋮ Volume and Entropy of Regular Timed Languages: Analytic Approach ⋮ Sampling automata and programs ⋮ Entropy of regular timed languages ⋮ A maximal entropy stochastic process for a timed automaton

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Timed regular expressions
• Volume and Entropy of Regular Timed Languages: Analytic Approach
• An Introduction to Symbolic Dynamics and Coding
• Computability and information in models of randomness and chaos
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Volume and Entropy of Regular Timed Languages: Discretization Approach