On the power of parallel communicating grammar systems with right-linear components
On the syntactic complexity of parallel communicating grammar systems
One-Rule Length-Preserving Rewrite Systems and Rational Transductions
We address the problem to know whether the relation induced by a one-rule length-preserving rewrite system is rational. We partially answer to a conjecture of Éric Lilin who conjectured in 1991 that a one-rule length-preserving rewrite system is a rational transduction if and only if the left-hand side u and the right-hand side v of the rule of the system are not quasi-conjugate or are equal, that means if u and v are distinct, there do not exist words x, y and z such that u = xyz and v = zyx. We...
One-rule semi-Thue systems with loops of length one, two or three
Overlap-free symmetric D0L words.