Increasingly advances in file carving, memory analysis and network forensics requires the
ability to identify the underlying type of a file given only a file fragment. Work to date on this …

Černý's conjecture asserts the existence of a synchronizing word of length at most (n-1) 2 for
any synchronized n-state deterministic automaton. We prove a quadratic upper bound on …

Data compression is a fundamental building block in a wide range of applications. Besides
its intended purpose to save valuable storage on hard disks, compression can be utilized to …

We refine a uniform algebraic approach for deriving upper bounds on reset thresholds of
synchronizing automata. We express the condition that an automaton is synchronizing in …

File carving techniques allow for recovery of files from storage devices in the absence of any
file system metadata. When data are encoded and compressed, the current paradigm of …

Abstract The Road Coloring Theorem states that every aperiodic directed graph with
constant out-degree has a synchronized coloring. This theorem had been conjectured …

Most complete binary prefix codes have a synchronizing string, that is a string that
resynchronizes the decoder regardless of its previous state. This work presents an upper …

We study the problems of finding a shortest synchronizing word and its length for a given
prefix code. This is done in two different settings: when the code is defined by an arbitrary …

In a text encoded with a Huffman code a bit error can propagate arbitrarily long. This paper
introduces a method for limiting such error propagation to not more than L bits, L being a …

In this paper we first present a block strategy for the generalized WZ factorization, which
consists of block factorizing a matrix A in the form A= WZW/sup-1/. This study shows how a …