Separability of M-Equivalent Words by Morphisms

DOI10.1142/S0129054116500039zbMath1339.68173MaRDI QIDQ2806556

Wen Chean Teh

Publication date: 18 May 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

morphism\(M\)-equivalenceParikh matrix mapping

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algebraic theory of languages and automata (68Q70)

Related Items (4)

On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices ⋮ Unnamed Item ⋮ On M-Equivalence and Strong M-Equivalence for Parikh Matrices ⋮ Freeness Problem for Matrix Semigroups of Parikh Matrices

Cites Work

• Some characterizations of Parikh matrix equivalent binary words
• Criteria for the matrix equivalence of words
• Reconstruction of sequences
• Extending Parikh matrices
• Core words and Parikh matrices
• Parikh matrices and amiable words
• Connections between subwords and certain matrix mappings
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• PARIKH MATRIX MAPPING AND LANGUAGES
• PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
• On Core Words and the Parikh Matrix Mapping
• On Context-Free Languages

This page was built for publication: Separability of M-Equivalent Words by Morphisms