Volume and entropy of regular timed languages: analytic approach

DOI10.1007/978-3-642-04368-0_4MaRDI QIDQ3648816zbMATH OpenOpenAlexFDO

Authors Eugene Asarin, Aldric Degorre

Publication date 1 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04368-0_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Measures of information, entropy (94A17)

Recommendations

• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Entropy of regular timed languages
• Two size measures for timed languages
• Generating Functions of Timed Languages
• Spectral gap in timed automata

Cites work

• A theory of timed automata
• An Introduction to Symbolic Dynamics and Coding
• Timed regular expressions
• Volume and Entropy of Regular Timed Languages: Discretization Approach

Cited in

(15)

• Distance on timed words and applications
• Entropy of regular timed languages
• A maximal entropy stochastic process for a timed automaton
• Spectral gap in timed automata
• Two size measures for timed languages
• Timed symbolic dynamics
• Thin and thick timed regular languages
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Removing all silent transitions from timed automata
• A linearly computable measure of string complexity
• Toward a timed theory of channel coding
• Frequencies in forgetful timed automata
• A Multiresolution Analysis of Temporal Logic
• 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: analytic approach

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