Parikh matrices and amiable words

From MaRDI portal
Publication:2474077


DOI10.1016/j.tcs.2007.10.022zbMath1134.68027MaRDI QIDQ2474077

Ion Petre, Radu Atanasiu, Adrian Atanasiu

Publication date: 5 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.022


68R15: Combinatorics on words

68Q45: Formal languages and automata


Related Items

On M-Equivalence and Strong M-Equivalence for Parikh Matrices, Unnamed Item, SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES, Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence, Parikh q-Matrices and q-Ambiguous Words, On Core Words and the Parikh Matrix Mapping, A New Operator over Parikh Languages, Reducing the ambiguity of Parikh matrices, A New Study of Parikh Matrices Restricted to Terms, On a conjecture about Parikh matrices, Subword histories and associated matrices, Criteria for the matrix equivalence of words, Elementary matrix equivalence and core transformation graphs for Parikh matrices, Order of weak \(M\)-relation and Parikh matrices, On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices, Certain distance-based topological indices of Parikh word representable graphs, Erasure and error correcting ability of Parikh matrices, \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited, Parikh matrices for powers of words, Core words and Parikh matrices, Some results on Parikh word representable graphs and partitions, Separability of M-Equivalent Words by Morphisms, Parikh Matrices and Strong M-Equivalence, Enriching Parikh matrix mappings, TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES, PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY, Binary Images, M −Vectors, and Ambiguity, PARIKH MATRIX MAPPING AND LANGUAGES, PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM, Some Algebraic Aspects of Parikh q-Matrices, Generalizations of Parikh mappings, ON PARIKH MATRICES, AMBIGUITY, AND PRINTS



Cites Work