Reachability via Cooperating Morphisms | Zendy

Juhani Karhumäki | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reachability via Cooperating Morphisms

Author(s) -

Juhani Karhumäki

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.12.028

Subject(s) - recursively enumerable language , reachability , morphism , simple (philosophy) , recursively enumerable set , mathematics , computer science , discrete mathematics , regular language , reachability problem , programming language , theoretical computer science , automaton , philosophy , epistemology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research