scientific article
From MaRDI portal
Publication:3942894
zbMath0483.94028MaRDI QIDQ3942894
Schützenberger, Marcel-Paul, Dominique Perrin
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
prefix codesbounded synchronization delaysource alphabetalphabet of the noiseless channelaverage cost of the transmissionentropy of the sourceletter costs
Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)
Related Items (max. 100)
On factorizing codes: Structural properties and related decision problems ⋮ Noncommutative factorization of variable-length codes ⋮ Synchronization and decomposability for a family of codes. II ⋮ Construction of a family of finite maximal codes ⋮ A completion algorithm for codes with bounded synchronization delay ⋮ On the factorization conjecture ⋮ Coding by minimal linear grammars ⋮ On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ A family of codes commutatively equivalent to prefix codes ⋮ A note on the triangle conjecture ⋮ On the triangle conjecture ⋮ On bounded linear codes and the commutative equivalence ⋮ An application of Hajós factorizations to variable-length codes ⋮ Completing codes ⋮ An enhanced property of factorizing codes ⋮ Unnamed Item ⋮ Some decompositions of Bernoulli sets and codes ⋮ Finite maximal codes and triangle conjecture ⋮ On a complete set of operations for factorizing codes ⋮ A conjecture on continued fractions ⋮ A counterexample to the triangle conjecture ⋮ On some Schützenberger conjectures ⋮ A partial result about the factorization conjecture for finite variable- length codes ⋮ A non-ambiguous decomposition of regular languages and factorizing codes ⋮ Some combinatorial results on Bernoulli sets and codes
This page was built for publication:
