A finite state version of the Kraft-McMillan theorem - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Computing Year : 2000

A finite state version of the Kraft-McMillan theorem

Abstract

The main result is a finite-state version of the Kraft-McMillan theorem characterizing the generating sequence of a k-ary regular tree. The proof uses a new contruction called the multiset construction which is a version with multiplicities of the well-known subset construction of automata theory
Fichier principal
Vignette du fichier
hal.pdf (274.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00619334 , version 1 (06-09-2011)

Identifiers

  • HAL Id : hal-00619334 , version 1

Cite

Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin. A finite state version of the Kraft-McMillan theorem. SIAM Journal on Computing, 2000, 30 (4), pp.1211-1230. ⟨hal-00619334⟩
124 View
196 Download

Share

Gmail Facebook X LinkedIn More