Border Array on Bounded Alphabet

Abstract

In this article we present an on-line linear time algorithm, to check if an integer array $f$ is a border array of some string $x$ built on a bounded size alphabet, which is simpler than the one given in [2]. Furthermore if $f$ is a border array we are able to build, on-line and in linear time, a string $x$ on a minimal size alphabet for which $f$ is the border array. The reader can refer to the URL http://al.jalix.org/Baba/Applet/ to run the algorithm on his own examples.