Pushdown dimension
David Doty, Jared Nichols
Abstract
This paper develops the theory of pushdown dimension and explores its relationship with finite-state dimension. Pushdown dimension is trivially bounded above by finite-state dimension for all sequences, since a pushdown gambler can simulate any finite-state gambler. We show that for every rational 0 < d < 1, there exists a sequence with finite-state dimension d whose pushdown dimension is at most d/2. This establishes a quantitative analogue of the well-known fact that pushdown automata decide strictly more languages than finite automata.
Create a lesson
Related papers
Galois Hulls of Generalized Roth-Lempel Codes and Their Applications to EAQECCs
Xuefei Wu, Qi Liu, Yingchun Chen et al.
Maximum Entropy Probability Distributions on Spheres with Fixed Mean Busemann Function and Holomorphic-Information-Geometric Model of Cognition
Vladimir Jacimovic
Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes
Minjia Shi, Shitao Li, Yuhong Xia et al.
A Mirror Vanishing Band for Weight Distributions of Binary Linear Codes
Xianmang He
Tri-Hybrid Beamforming Design for Large-Scale MIMO ISAC Systems
Tianyu Fang, Mengyuan Ma, Markku Juntti et al.
Equivalence Between Nested Gibbs Measures and Log-Linear Combinations of Gibbs Measures
Yaiza Bermudez, Samir M. Perlaza, Iñaki Esnaola