The goal of this presentation is to analyze the equality mechanism of cooperating morphisms of free monoids, and to point out that the reachability questions lead to the undecidability and easy characterizations of recursively enumerable languages. In particular, we aim to show, which subconstructions are needed in such results. Moreover, we recall that in some cases the undecidability of the reachability is achieved although the sets of all reachable objects are simple, or more formally, regular languages. © 2008 Elsevier B.V. All rights reserved.
Karhumäki, J. (2008). Reachability via Cooperating Morphisms. Electronic Notes in Theoretical Computer Science, 223(C), 15–27. https://doi.org/10.1016/j.entcs.2008.12.028