Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 81 tok/s
Gemini 2.5 Pro 57 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 104 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Recognizability of morphisms (2110.10267v3)

Published 19 Oct 2021 in math.DS and cs.FL

Abstract: We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss\'e's theorem and actually of a generalization to non primitive morphisms due to Berth\'e et al. We actually prove the result of Berth\'e et al. for the most general class of morphisms, including ones with erasable letters. It is derived from a result concerning elementary morphisms for which we also provide a new proof. We also show how to decide whether an injective morphism is recognizable on the full shift for aperiodic points.

Citations (11)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.