A characterization of complete finite prefix codes in an arbitrary submonoid of A
Journal of Automata, Languages and Combinatorics
Completing prefix codes in submonoids
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the Completion of Codes in Submonoids with Finite Rank
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Completing circular codes in regular submonoids
Theoretical Computer Science
Reduced languages as ω-generators
DLT'07 Proceedings of the 11th international conference on Developments in language theory
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.89 |