On periodic points of free inverse monoid endomorphisms
classification
🧮 math.GR
cs.FL
keywords
freeinversemonoidendomorphismlanguageperiodicpointrepresented
read the original abstract
It is proved that the periodic point submonoid of a free inverse monoid endomorphism is always finitely generated. Using Chomsky's hierarchy of languages, we prove that the fixed point submonoid of an endomorphism of a free inverse monoid can be represented by a context-sensitive language but, in general, it cannot be represented by a context-free language.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.