Remarks concerning the freeness problem over morphism and matrix semigroups.

DOI10.1016/j.tcs.2014.08.013zbMath1339.20049OpenAlexW2076013530MaRDI QIDQ300262

Juha Honkala

Publication date: 27 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.08.013

zbMATH Keywords

decidabilitymatrix semigroupsfreeness problemmatrix semiringsmorphism semigroups

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) Decidability of theories and sets of sentences (03B25) Semirings (16Y60)

Related Items (2)

A characterization of free pairs of upper triangular free monoid morphisms ⋮ Relations in the semigroup of 2 × 2 upper-triangular matrices

Cites Work

• Reachability problems in quaternion matrix and rotation semigroups
• On finite semigroups of matrices
• On the decidability of semigroup freeness
• UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
• ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS

This page was built for publication: Remarks concerning the freeness problem over morphism and matrix semigroups.