Equality sets of prefix morphisms and regular star languages
Information Processing Letters
Equality sets of prefix morphisms and regular star languages
Information Processing Letters
Finite sets of words and computing
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
The parametric ordinal-recursive complexity of post embedding problems
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |