NUMBER SYSTEMS AND THE INJECTIVITY PROBLEM FOR MATRIX REPRESENTATIONS OF FREE MONOIDS

DOI10.1142/S0218196709005044MaRDI QIDQ3636025zbMATH OpenWikidataFDO

Authors Juha Honkala

Publication date 30 June 2009

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218196709005044

zbMATH Keywords

decidabilityfree generating setsfree monoidsinjectivitymatrix representationsnumber systems

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Free semigroups, generators and relations, word problems (20M05) Semigroups of transformations, relations, partitions, etc. (20M20) Formal languages and automata (68Q45)

Recommendations

• The freeness problem over matrix semigroups and bounded languages
• ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
• Remarks concerning the freeness problem over morphism and matrix semigroups.
• ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
• Matrix semigroup freeness problems in \(\mathrm{SL}(2,\mathbb {Z})\)

Cites work

• ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
• ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS

Cited in

(4)

• The freeness problem over matrix semigroups and bounded languages
• A characterization of free pairs of upper triangular free monoid morphisms
• The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
• Relations in the semigroup of \(2\times 2\) upper-triangular matrices

This page was built for publication: NUMBER SYSTEMS AND THE INJECTIVITY PROBLEM FOR MATRIX REPRESENTATIONS OF FREE MONOIDS

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