Volume and Entropy of Regular Timed Languages: Discretization Approach

DOI10.1007/978-3-642-04081-8_6MaRDI QIDQ3184666zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Volume and entropy of regular timed languages: analytic approach
• Entropy of regular timed languages
• Two size measures for timed languages
• Thin and thick timed regular languages
• Generating Functions of Timed Languages

Cites work

• A theory of timed automata
• An introduction to Kolmogorov complexity and its applications
• An Introduction to Symbolic Dynamics and Coding
• Computability and information in models of randomness and chaos
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3844071 (Why is no real title available?)
• scientific article; zbMATH DE number 1304998 (Why is no real title available?)
• Timed regular expressions
• Volume and entropy of regular timed languages: analytic approach

Cited in

(17)

• Distance on timed words and applications
• Sampling automata and programs
• Entropy of regular timed languages
• A maximal entropy stochastic process for a timed automaton
• Information rate of some classes of non-regular languages: an automata-theoretic approach
• Spectral gap in timed automata
• Timed symbolic dynamics
• Emptiness and universality problems in timed automata with positive frequency
• Thin and thick timed regular languages
• Quantifying communication in synchronized languages
• Quantifying communication in synchronized languages
• Volume and entropy of regular timed languages: analytic approach
• A linearly computable measure of string complexity
• Toward a timed theory of channel coding
• Lossiness of communication channels modeled by transducers1
• Max-entropy sampling for deterministic timed automata under linear duration constraints
• Execution information rate for some classes of automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184666)