Computing the bandwidth of meager timed automata

DOI10.1007/978-3-031-71112-1_2MaRDI QIDQ6666783zbMATH OpenFDO

Authors Eugene Asarin, Aldric Degorre, Cătălin Dima, Bernardo Jacobo Inclán

Publication date 20 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71112-1_2

zbMATH Keywords

bandwidthentropyinformationtimed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A theory of timed automata
• An example of an indexed language of intermediate growth
• An Introduction to Symbolic Dynamics and Coding
• Bounded delay timed channel coding
• Context-free languages of sub-exponential growth
• Distance on timed words and applications
• Dynamical properties of timed automata
• Entropy of regular timed languages
• Factorization forests of finite height
• Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
• Finite state languages
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• scientific article; zbMATH DE number 3147888 (Why is no real title available?)
• scientific article; zbMATH DE number 1337733 (Why is no real title available?)
• scientific article; zbMATH DE number 3236302 (Why is no real title available?)
• Hybrid Systems: Computation and Control
• Real-time automata

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)