Deterministic pushdown automata can compress some normal sequences

DOI10.46298/LMCS-20(3:15)2024MaRDI QIDQ6597965

Olivier Carton, Sylvain Perifel

Publication date: 4 September 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

normalitycompressionpushdown automata

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Perfect necklaces
• Normality and automata
• On encoding and decoding with two-way head machines
• Les probabilités denombrables et leurs applications arithmétiques.
• Finite-state dimension
• Normal numbers and finite automata
• Normality and two-way automata
• The Construction of Decimals Normal in the Scale of Ten

This page was built for publication: Deterministic pushdown automata can compress some normal sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597965)