  Covers being one of the most popular form of regularities in strings, have
drawn much attention over time. In this paper, we focus on the problem of
linear time inference of strings from cover arrays using the least sized
alphabet possible. We present an algorithm that can reconstruct a string $x$
over a two-letter alphabet whenever a valid cover array $C$ is given as an
input. This algorithm uses several interesting combinatorial properties of
cover arrays and an interesting relation between border array and cover array
to achieve this. Our algorithm runs in linear time.
