Criteria for the matrix equivalence of words
From MaRDI portal
Publication:964400
DOI10.1016/j.tcs.2010.01.036zbMath1192.68422OpenAlexW2095541717MaRDI QIDQ964400
Publication date: 15 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.036
Related Items (26)
On a conjecture about Parikh matrices ⋮ Elementary matrix equivalence and core transformation graphs for Parikh matrices ⋮ A New Operator over Parikh Languages ⋮ PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Parikh Matrices: Subword Indicators and Degrees of Ambiguity ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism ⋮ On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices ⋮ On M-Equivalence and Strong M-Equivalence for Parikh Matrices ⋮ Relations on words ⋮ Freeness Problem for Matrix Semigroups of Parikh Matrices ⋮ Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence ⋮ Unnamed Item ⋮ Separability of M-Equivalent Words by Morphisms ⋮ POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS ⋮ The binomial equivalence classes of finite words ⋮ Erasure and error correcting ability of Parikh matrices ⋮ Parikh Matrices and Strong M-Equivalence ⋮ Parikh matrices for powers of words ⋮ Enriching Parikh matrix mappings ⋮ On Core Words and the Parikh Matrix Mapping ⋮ TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES ⋮ A New Study of Parikh Matrices Restricted to Terms ⋮ Core words and Parikh matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some characterizations of Parikh matrix equivalent binary words
- Subword conditions and subword histories
- Subword histories and associated matrices
- Restricted \(k\)-ary words and functional equations
- Subword histories and Parikh matrices
- Extending Parikh matrices
- On fairness of D0L systems
- Parikh matrices and amiable words
- Connections between subwords and certain matrix mappings
- Independence of certain quantities indicating subword occurrences
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- ON PARIKH MATRICES
- SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
This page was built for publication: Criteria for the matrix equivalence of words
