Computer Science – Information Theory
Scientific paper
2005-04-12
Computer Science
Information Theory
10 page main body; 12 page appendix of proofs
Scientific paper
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.
Doty David
Nichols Jonathan
No associations
LandOfFree
Pushdown dimension does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Pushdown dimension, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pushdown dimension will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-249345