Volume and Entropy of Regular Timed Languages: Analytic Approach

DOI10.1007/978-3-642-04368-0_4zbMath1262.68083OpenAlexW1768627876MaRDI QIDQ3648816

Aldric Degorre, Eugene Asarin

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)

Related Items (8)

Thin and Thick Timed Regular Languages ⋮ Volume and Entropy of Regular Timed Languages: Discretization Approach ⋮ Timed Symbolic Dynamics ⋮ A Multiresolution Analysis of Temporal Logic ⋮ A linearly computable measure of string complexity ⋮ Removing All Silent Transitions from Timed Automata ⋮ Entropy of regular timed languages ⋮ A maximal entropy stochastic process for a timed automaton

Cites Work

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

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