International Journal of Computer Mathematics, 1982
Syntactic compression codes compress the tree, which is the syntax of a binary source message. Th... more Syntactic compression codes compress the tree, which is the syntax of a binary source message. The ones considered here originate from image processing. The syntactic trees usedhave a constant valency and their binary labels distinguish whether the source substring derived from a node is completely zero or not. We compress them simply by deleting some redundant subtrees.These codes fall into
Our “algebraic data” merely are the elements of a free algebra and universal matrices (certain fa... more Our “algebraic data” merely are the elements of a free algebra and universal matrices (certain families of them able to model objects of a combinatorial interest). Their “analytic features” are the features one can define and study by exploiting an analytic monoid associated with the algebra and among them we consider the “inner” ones, that related with certain subalgebras. Vector
To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary t... more To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension does not make the starting objects more complex.
International Journal of Computer Mathematics, 1982
Syntactic compression codes compress the tree, which is the syntax of a binary source message. Th... more Syntactic compression codes compress the tree, which is the syntax of a binary source message. The ones considered here originate from image processing. The syntactic trees usedhave a constant valency and their binary labels distinguish whether the source substring derived from a node is completely zero or not. We compress them simply by deleting some redundant subtrees.These codes fall into
Our “algebraic data” merely are the elements of a free algebra and universal matrices (certain fa... more Our “algebraic data” merely are the elements of a free algebra and universal matrices (certain families of them able to model objects of a combinatorial interest). Their “analytic features” are the features one can define and study by exploiting an analytic monoid associated with the algebra and among them we consider the “inner” ones, that related with certain subalgebras. Vector
To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary t... more To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension does not make the starting objects more complex.
Uploads
Papers by Gabriele Ricci