scientific article; zbMATH DE number 2087219
From MaRDI portal
Publication:4737903
zbMath1073.68670MaRDI QIDQ4737903
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2295/22950155.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Prefix, length-variable, comma-free codes (94A45)
Related Items
Lossiness of communication channels modeled by transducers1 ⋮ Quantifying communication in synchronized languages ⋮ Quantifying Communication in Synchronized Languages ⋮ Information rate of some classes of non-regular languages: an automata-theoretic approach ⋮ Execution information rate for some classes of automata ⋮ Sampling automata and programs
This page was built for publication:
