Journal of Symbolic Computation
Multiple factorizations of words and defect effect
Theoretical Computer Science
The Equivalence Problem of Finite Substitutions on ab*c, with Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Decision Questions on Integer Matrices
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Combinatorial and Computational Problems on Finite Sets of Words
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Many aspects of defect theorems
Theoretical Computer Science - Words, languages and combinatorics
Explicit test sets for iterated morphisms in free monoids and metabelian groups
Theoretical Computer Science - Insightful theory
On systems of word equations with simple loop sets
Theoretical Computer Science
An Analysis and a Reproof of Hmelevskii's Theorem
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Test sets for large families of languages
DLT'03 Proceedings of the 7th international conference on Developments in language theory
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Solving Equivalence of Recurrent Sequences in Groups by Polynomial Manipulation
Fundamenta Informaticae
The simplest language where equivalence of finite substitutions is undecidable
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 5.23 |