| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10334264 | Theoretical Computer Science | 2005 | 15 Pages |
Abstract
As applications of the REG-entropy rate upper bound and the block-entropy rate characterization, we prove that every regular language has finite-state dimension 0 and that normality is equivalent to finite-state dimension 1.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Chris Bourke, John M. Hitchcock, N.V. Vinodchandran,