On completion of codes with finite deciphering delay

On maximal codes with a finite interpreting delay

Theoretical Computer Science

Locally complete sets and finite decomposable codes

Theoretical Computer Science

Combinatorial properties of codes with degree n

European Journal of Combinatorics

Completing comma-free codes

Theoretical Computer Science

Completion of codes with finite bi-decoding delays

Theoretical Computer Science

On maximal synchronous codes

Theoretical Computer Science - WORDS

On the Completion of Codes in Submonoids with Finite Rank

Fundamenta Informaticae - SPECIAL ISSUE MCU2004

Completing circular codes in regular submonoids

Theoretical Computer Science

Completing a code in a regular submonoid of the free monoid

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Codes and length-increasing transitive binary relations

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing

On the Completion of Codes in Submonoids with Finite Rank

Fundamenta Informaticae - SPECIAL ISSUE MCU2004