Error-detecting properties of languages
Theoretical Computer Science
Asymptotically optimal low-cost solid codes
Journal of Automata, Languages and Combinatorics
A characterization of complete finite prefix codes in an arbitrary submonoid of A
Journal of Automata, Languages and Combinatorics
On the Completion of Codes in Submonoids with Finite Rank
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Information and Computation
Completing a code in a regular submonoid of the free monoid
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
On the Completion of Codes in Submonoids with Finite Rank
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Hi-index | 5.23 |