On maximal codes with a finite interpreting delay
Theoretical Computer Science
Locally complete sets and finite decomposable codes
Theoretical Computer Science
Theoretical Computer Science - WORDS
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
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
On the Completion of Codes in Submonoids with Finite Rank
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Hi-index | 0.01 |