Theoretical Computer Science - The art of theory
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
Theoretical Computer Science
Symbolic dynamics, flower automata and infinite traces
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Completing a code in a regular submonoid of the free monoid
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case
Fundamenta Informaticae
On the Completion of Codes in Submonoids with Finite Rank
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |