6533b833fe1ef96bd129c09e
RESEARCH PRODUCT
Coding Sequences with Constraints
A. Restivosubject
Prefix codeParsingFinite-state machineComputer sciencecomputer.software_genrecomputerAlgorithmCoding (social sciences)description
In this paper we consider the following problem: given all bi-infinite sequences of symbols satisfying certain constraints, search for a set X of words such that i): any concatenation of elements of X satisfies these constraints and ii): any sequence verifying the constraints can be “parsed” in elements of X.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1990-01-01 |