Freeness Problem for Matrix Semigroups of Parikh Matrices

DOI10.3233/FI-2021-2029MaRDI QIDQ5164864

Wen Chean Teh, Adrian Atanasiu, Denis C. K. Wong

Publication date: 15 November 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

decidabilitymatrix semigroupsParikh matricesfreeness problem

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Reachability problems in quaternion matrix and rotation semigroups
• Criteria for the matrix equivalence of words
• Reconstruction of sequences
• On finite semigroups of matrices
• Elementary matrix equivalence and core transformation graphs for Parikh matrices
• On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
• The freeness problem over matrix semigroups and bounded languages
• On the problem of freeness of multiplicative matrix semigroups
• Context-free word problem semigroups
• Separability of M-Equivalent Words by Morphisms
• On the decidability of semigroup freeness
• PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
• Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$
• A sharpening of the Parikh mapping
• Semigroups with a Context-Free Word Problem
• BINARY AMIABLE WORDS
• ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
• Word hyperbolic semigroups
• Parikh Motivated Study on Repetitions in Words
• Unsolvability in 3 × 3 Matrices
• ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
• Parikh Matrices: Subword Indicators and Degrees of Ambiguity

This page was built for publication: Freeness Problem for Matrix Semigroups of Parikh Matrices