On Core Words and the Parikh Matrix Mapping
From MaRDI portal
Publication:5250280
DOI10.1142/s0129054115500069zbMath1312.68124MaRDI QIDQ5250280
Publication date: 19 May 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054115500069
68Q45: Formal languages and automata
Related Items
On M-Equivalence and Strong M-Equivalence for Parikh Matrices, Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator, A New Operator over Parikh Languages, Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words, \(M\)-equivalence of Parikh matrix over a ternary alphabet, On a conjecture about Parikh matrices, Parikh word representable graphs and morphisms, Elementary matrix equivalence and core transformation graphs for 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, Parikh word representability of bipartite permutation graphs, Algebraic properties of Parikh matrices of binary picture arrays, 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, Wiener-type indices of Parikh word representable graphs
Cites Work
- Some characterizations of Parikh matrix equivalent binary words
- Subword histories and associated matrices
- Criteria for the matrix equivalence of words
- Extending Parikh matrices
- Parikh matrices and amiable words
- Independence of certain quantities indicating subword occurrences
- Enriching Parikh 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
- ON PARIKH MATRICES
- SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
- On Context-Free Languages
