The finiteness problem for monoids of morphisms.

DOI10.1051/ITA/2014028MaRDI QIDQ5245727zbMATH OpenOpenAlexFDO

Authors Juha Honkala

Publication date 15 April 2015

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2014028

zbMATH Keywords

decidabilityfinitely generated monoidsfiniteness problemfree monoid morphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Mappings of semigroups (20M15)

Recommendations

• Some non finitely generated monoids of repetition-free endomorphisms.
• On the periodicity of morphisms on free monoids
• New undecidability results for finitely presented monoids
• scientific article; zbMATH DE number 1254106
• The monomorphism problem in free groups.

Cites work

• scientific article; zbMATH DE number 3421926 (Why is no real title available?)
• La finitude des représentations linéaires des semi-groupes est decidable
• M/M/1 retrial queue with collisions and working vacation interruption under N-policy
• Noncommutative rational series with applications
• On finite semigroups of matrices
• The Burnside problem for semigroups

Cited in

(7)

• Some non finitely generated monoids of repetition-free endomorphisms.
• scientific article; zbMATH DE number 5218144 (Why is no real title available?)
• On infinite words determined by L systems
• Eraser morphisms and membership problem in groups and monoids
• An isomorphism between monoids of external embeddings: About definability in arithmetic
• Language-theoretic problems in certain matrix monoids
• Finite basis problem for 2-testable monoids.

This page was built for publication: The finiteness problem for monoids of morphisms.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5245727)