Separability of M-equivalent words by morphisms
From MaRDI portal
Publication:2806556
DOI10.1142/S0129054116500039zbMATH Open1339.68173MaRDI QIDQ2806556FDOQ2806556
Authors: Wen Chean Teh 
Publication date: 18 May 2016
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Core words and Parikh matrices
- Parikh matrices and amiable words
- Parikh matrices, amiability and Istrail morphism
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- On core words and the Parikh matrix mapping
- On Context-Free Languages
- Some characterizations of Parikh matrix equivalent binary words
- Criteria for the matrix equivalence of words
- Extending Parikh matrices
- Subword occurrences, Parikh matrices and Lyndon images
- Connections between subwords and certain matrix mappings
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- Reconstruction of sequences
- PARIKH MATRIX MAPPING AND LANGUAGES
Cited In (11)
- Criteria for the matrix equivalence of words
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- On \(M\)-equivalence and strong \(M\)-equivalence for Parikh matrices
- Morphic words and equidistributed sequences
- Parikh matrices and strong \(M\)-equivalence
- Title not available (Why is that?)
- Lower bounds on words separation: are there short identities in transformation semigroups?
- Morphisms fixing words associated with exchange of three intervals
- Algebraic properties of Parikh matrices of words under an extension of Thue morphism
- Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
- Freeness problem for matrix semigroups of Parikh matrices
This page was built for publication: Separability of \(M\)-equivalent words by morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806556)
