Measure of infinitary codes
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...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1994
|
| Sorozat: | Acta cybernetica
11 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12525 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 127-137 |
| ISSN: | 0324-721X |