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

DOI10.1142/S0218196709005044zbMath1203.20049WikidataQ122723386 ScholiaQ122723386MaRDI QIDQ3636025

Juha Honkala

Publication date: 30 June 2009

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

zbMATH Keywords

injectivitynumber systemsdecidabilityfree monoidsmatrix representationsfree generating sets

Mathematics Subject Classification ID

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

Related Items (1)

The freeness problem over matrix semigroups and bounded languages

Cites Work

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

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