Reachability via Cooperating Morphisms

  • Karhumäki J
  • 2

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

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. © 2008 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • equality languages
  • morphisms
  • reachability problems
  • recursively enumerable languages

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Juhani Karhumäki

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free