Bandwidth of timed automata: 3 classes

DOI10.4230/LIPICS.FSTTCS.2023.10MaRDI QIDQ6951730zbMATH OpenFDO

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

Publication date 28 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2023.10

zbMATH Keywords

bandwidthentropyfactorization forestsinformation theoryorbit graphstimed automata

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A Mathematical Theory of Communication
• A theory of timed automata
• An example of an indexed language of intermediate growth
• An Introduction to Symbolic Dynamics and Coding
• Bandwidth of timed automata: 3 classes
• Boolean representations of simplicial complexes and matroids
• 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
• Factorization forests of finite height
• Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
• Finite state languages
• scientific article; zbMATH DE number 3147888 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• On the degree of ambiguity of finite automata
• Three approaches to the quantitative definition of information^*
• Toward a timed theory of channel coding
• Wordgen : a Timed word Generation Tool

Cited in

(1)

• Bandwidth of timed automata: 3 classes

This page was built for publication: Bandwidth of timed automata: 3 classes

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