Back to Search
Start Over
Information rate of some classes of non-regular languages: An automata-theoretic approach.
- Source :
-
Information & Computation . Oct2017, Vol. 256, p45-61. 17p. - Publication Year :
- 2017
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08905401
- Volume :
- 256
- Database :
- Academic Search Index
- Journal :
- Information & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 125338289
- Full Text :
- https://doi.org/10.1016/j.ic.2017.04.008