| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950575 | Information and Computation | 2017 | 17 Pages |
Abstract
We show that the information rate of the language accepted by a reversal-bounded deterministic counter machine is computable. For the nondeterministic case, we provide computable upper bounds. For the class of languages accepted by multi-tape deterministic finite automata, the information rate is computable as well.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra,