Locally complete sets and finite decomposable codes
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
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Hi-index | 5.23 |