Thin and thick timed regular languages
From MaRDI portal
Publication:3172847
Recommendations
Cites work
- scientific article; zbMATH DE number 1189294 (Why is no real title available?)
- scientific article; zbMATH DE number 1304998 (Why is no real title available?)
- scientific article; zbMATH DE number 1361127 (Why is no real title available?)
- scientific article; zbMATH DE number 1444348 (Why is no real title available?)
- 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
- Robust safety of timed automata
- Sampled semantics of timed automata
- Two size measures for timed languages
- Volume and Entropy of Regular Timed Languages: Discretization Approach
- Volume and entropy of regular timed languages: analytic approach
Cited in
(6)
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)