Some easily decoded, efficient, burst error correcting block codes. An infinite hierarchy of linear local adjunct languages. Structural aspects of local adjunct languages. Minimal-program complexity of sequences with restricted resources. Integral sequential word functions and growth equivalence of Lindenmayer systems.
Permutation cascades with normalized cells.
Grzegorz Rozenberg . T0L systems and languages. A method of synthesis and decomposition of autonomous linear sequential circuits. Identifying an unknown process by utilizing randomly chosen inputs. Four fundamental parameters of a code and their combinatorial significance.