Reachability via Cooperating Morphisms

DOI10.1016/J.ENTCS.2008.12.028zbMath1337.68153OpenAlexW2032104744MaRDI QIDQ4982083

Juhani Karhumäki

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.028

zbMATH Keywords

morphismsrecursively enumerable languagesreachability problemsequality languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Attainable sets, reachability (93B03)

Related Items (1)

ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS

Cites Work

• Test sets for morphisms with bounded delay
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• A note on decidability questions on presentations of word semigroups
• Equality languages and fixed point languages
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reachability via Cooperating Morphisms