We present algorithms computing the non-overlapping Lempel–Ziv-77 factorization and longest previous factor table within small space in linear or near-linear time with help of modern suffix tree representations fitting into limited space. With similar techniques, we show how to answer substring compression queries for Lempel–Ziv-78 a possible logarithmic multiplicative slowdown depending on use...

We introduce a scheme to simplify a multi-valued network using redundancy removal techniques. Recent methods [1], [2] for binary redundancy removal avoid the use of state traversal. Additionally, [2] finds multiple compatible redundancies simultaneously. We extend these powerful advances in the field of binary redundancy removal to perform redundancy removal for multi-valued networks. First we ...

In this paper we introduce XTCTL, a dense-time extension of the multi-valued Computation Tree Logic (XCTL) in [1]. Alternatively, XTCTL is a multi-valued extension of TCTL [2] over quasiboolean algebras. A multi-valued quotient is defined which enables to reduce dense-time XTCTL model checking to the untimed case.

The goal of this project is to develop a MV optimization package and use MV logic optimization to produce efficient code that simulates the MV network. The package is implemented as a MV layer on top of SIS. The process includes taking in a blif mv file, parsing it into a MVSIS network, applying optimization techniques on the network, performing technology mapping on the resulting network, and ...

We survey some of the methods used for manipulating, representing, and optimizing multi-valued logic with the view of both building a better understanding of the more specialized binary-valued logic, as well as motivating research towards a true multi-valued multi-level optimization package.

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

Abstract—In this paper, we propose a chaotic complexvalued associative memory which can realize a dynamic association of multi-valued patterns. The proposed model is based on a complex-valued associative memory and a chaotic associative memory. The complex-valued associative memory can treat multi-valued patterns, and the chaotic associative memory can recall stored patterns dynamically. The pr...

Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that time. Since then, they have received a lot of attention. Moreover, pattern databases are also researched in conjunction with other domain-independent techniques for solving planning tasks. However, they are not the onl...