Reachability via Cooperating Morphisms

Authors:
Juhani Karhumäki
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 3
Cited 0

Combinatorics of words

Handbook of formal languages, vol. 1
A Purely Homomorphic Characterization of Recursively Enumerable Sets

Journal of the ACM (JACM)
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.