Nguyen Huong Lam and Van Do Long: Measure of infinitary codes. In: Acta cybernetica, (11) 3. pp. 127-137. (1994)
Preview |
Cikk, tanulmány, mű
cybernetica_011_numb_003_127-137.pdf Download (709kB) | Preview |
Abstract
An attempt to define a measure on the set AN of infinite words over an alphabet A starting from any Bernoulli distribution on A is proposed. With respect to this measure, any recognizable (in the sense of Buchi-McNaughton) language is measurable and the Kraft-McMillan inequality holds for measurable infinitary codes. Nevertheless, we face some "anomalies" in contrast with ordinary codes.
Item Type: | Article |
---|---|
Journal or Publication Title: | Acta cybernetica |
Date: | 1994 |
Volume: | 11 |
Number: | 3 |
ISSN: | 0324-721X |
Page Range: | pp. 127-137 |
Language: | English |
Place of Publication: | Szeged |
Related URLs: | http://acta.bibl.u-szeged.hu/38497/ |
Uncontrolled Keywords: | Számítástechnika, Kibernetika |
Additional Information: | Bibliogr.: 137. p. ; összefoglalás angol nyelven |
Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
Date Deposited: | 2016. Oct. 15. 12:26 |
Last Modified: | 2022. Jun. 13. 11:49 |
URI: | http://acta.bibl.u-szeged.hu/id/eprint/12525 |
Actions (login required)
![]() |
View Item |