| Research>>> Acta Cybernetica>>> Previous Volumes>>> | Magyarul |
Measure of Infinitary Codes
Nguyen Huong Lam 
Do Long Van 
Abstract:
An attempt to define a measure on the set
of
infinite words over an alphabet 
starting from any Bernoulli
distribution on is proposed. With respect to this
measure, any recognizable (in the sense of
Büchi-McNaughton) language is measurable and the
Kraft-McMillan inequality holds for measurable infinitary
codes. Nevertheless, we face some "anomalies" in contrast with
ordinary codes.
Gyenizse Pal 1996. Szeptember 4. Szerda 13:19:36 MET DST