Computing the bandwidth of meager timed automata
From MaRDI portal
Publication:6666783
DOI10.1007/978-3-031-71112-1_2MaRDI QIDQ6666783
Eugene Asarin, Bernardo Jacobo Inclán, Cătălin Dima, Aldric Degorre
Publication date: 20 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factorization forests of finite height
- An example of an indexed language of intermediate growth
- A theory of timed automata
- Context-free languages of sub-exponential growth
- Distance on timed words and applications
- Dynamical properties of timed automata
- Bounded delay timed channel coding
- Entropy of regular timed languages
- Real-time automata
- Finite state languages
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- An Introduction to Symbolic Dynamics and Coding
- Hybrid Systems: Computation and Control
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
This page was built for publication: Computing the bandwidth of meager timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666783)
