The homomorphism problem for the free monoid
Discrete Mathematics
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The homomorphism problem for trace monoids
Theoretical Computer Science - WORDS
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
The Unique Decipherability in the Monoid of Regular Languages is Undecidable
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
| Hi-index | 0.01 |