Olivier Carton ; Sylvain Perifel - Deterministic pushdown automata can compress some normal sequences

lmcs:9618 - Logical Methods in Computer Science, August 12, 2024, Volume 20, Issue 3 - https://doi.org/10.46298/lmcs-20(3:15)2024
Deterministic pushdown automata can compress some normal sequencesArticle

Authors: Olivier Carton ; Sylvain Perifel

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.

https://doi.org/10.46298/lmcs-20(3:15)2024
Source: arXiv.org:2205.00734
Volume: Volume 20, Issue 3
Published on: August 12, 2024
Accepted on: April 30, 2024
Submitted on: May 27, 2022
Keywords: Computer Science - Formal Languages and Automata Theory
Licence: Attribution 4.0 International (CC BY 4.0)

Share and export

Consultation statistics

This page has been seen 2727 times.
This article's PDF has been downloaded 524 times.