Deterministic pushdown automata can compress some normal sequences

Abstract

In this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author.

Keywords

• computer science - formal languages and automata theory