Thin and thick timed regular languages

DOI10.1007/978-3-642-24310-3_9MaRDI QIDQ3172847zbMATH OpenOpenAlexFDO

Authors Nicolas Basset, Eugene Asarin

Publication date 7 October 2011

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

Full work available at URL https://hal-upec-upem.archives-ouvertes.fr/hal-00793583/file/FORMATS11.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Entropy of regular timed languages
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Volume and entropy of regular timed languages: analytic approach
• A nonarchimedian discretization for timed languages
• Formal Modeling and Analysis of Timed Systems

Cites work

• A theory of timed automata
• Almost ASAP semantics: from timed models to timed implementations
• Computing the Continuous Discretely
• Dynamical properties of timed automata
• Efficient Detection of Zeno Runs in Timed Automata
• Factorization forests of finite height
• Foundations of Software Science and Computation Structures
• Mean topological dimension
• On discretization of delays in timed automata and digital circuits
• Pumping lemmas for timed automata
• Robust safety of timed automata
• Robust undecidability of timed and hybrid systems
• Sampled semantics of timed automata
• Timed automata and the theory of real numbers
• Two size measures for timed languages
• Volume and entropy of regular timed languages: analytic approach
• Volume and Entropy of Regular Timed Languages: Discretization Approach

Cited in

(6)

• Entropy of regular timed languages
• A maximal entropy stochastic process for a timed automaton
• Two size measures for timed languages
• Generating Functions of Timed Languages
• Timed symbolic dynamics
• Volume and Entropy of Regular Timed Languages: Discretization Approach

This page was built for publication: Thin and thick timed regular languages

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