ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS

DOI10.1142/S0129054109006899zbMath1187.68366MaRDI QIDQ3646166

Juhani Karhumäki

Publication date: 19 November 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

morphismsrecursively enumerable languagesreachability problemsequality languages

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Test sets for morphisms with bounded delay
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• 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
• Reachability via Cooperating Morphisms
• A variant of a recursively unsolvable problem

This page was built for publication: ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS