Pages that link to "Item:Q3184666"
From MaRDI portal
The following pages link to Volume and Entropy of Regular Timed Languages: Discretization Approach (Q3184666):
Displaying 13 items.
- Quantifying communication in synchronized languages (Q344766) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Execution information rate for some classes of automata (Q899317) (← links)
- Sampling automata and programs (Q2339473) (← links)
- Entropy of regular timed languages (Q2343131) (← links)
- A maximal entropy stochastic process for a timed automaton (Q2347798) (← links)
- Information rate of some classes of non-regular languages: an automata-theoretic approach (Q2407088) (← links)
- Timed Symbolic Dynamics (Q2945581) (← links)
- Emptiness and Universality Problems in Timed Automata with Positive Frequency (Q3012924) (← links)
- Thin and Thick Timed Regular Languages (Q3172847) (← links)
- Quantifying Communication in Synchronized Languages (Q3196422) (← links)
- Volume and Entropy of Regular Timed Languages: Analytic Approach (Q3648816) (← links)
- Lossiness of communication channels modeled by transducers1 (Q5283445) (← links)