On some Schützenberger conjectures
Information and Computation
Some combinatorial results on Bernoulli sets and codes
Theoretical Computer Science
Locally complete sets and finite decomposable codes
Theoretical Computer Science
Constructing Finite Maximal Codes from Schützenberger Conjecture
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Completion of codes with finite bi-decoding delays
Theoretical Computer Science
A characterization of complete finite prefix codes in an arbitrary submonoid of A
Journal of Automata, Languages and Combinatorics
An enhanced property of factorizing codes
Theoretical Computer Science - The art of theory
Completing codes and the Rédei property of groups
Theoretical Computer Science
On the Completion of Codes in Submonoids with Finite Rank
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
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 | 0.00 |