Subword histories and Parikh matrices
From MaRDI portal
Publication:1878676
DOI10.1016/j.jcss.2003.04.001zbMath1072.68085OpenAlexW2005181510MaRDI QIDQ1878676
Alexandru Mateescu, Arto Salomaa, Sheng Yu
Publication date: 8 September 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2003.04.001
Related Items (44)
On computational complexity of graph inference from counting ⋮ Scattered Factor-Universality of Words ⋮ Context-Freeness of Word-MIX Languages ⋮ Extending Parikh matrices ⋮ Some characterizations of Parikh matrix equivalent binary words ⋮ COUNTING SUBWORDS USING A TRIE AUTOMATON ⋮ PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY ⋮ On fairness of D0L systems ⋮ Some Algebraic Aspects of Parikh q-Matrices ⋮ Subword conditions and subword histories ⋮ Absent Subsequences in Words ⋮ Ranking and Unranking k-Subsequence Universal Words ⋮ Longest Common Subsequence with Gap Constraints ⋮ Parikh Matrices: Subword Indicators and Degrees of Ambiguity ⋮ Subsequences in bounded ranges: matching and analysis problems ⋮ 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 ⋮ Absent subsequences in words ⋮ ON INEQUALITIES BETWEEN SUBWORD HISTORIES ⋮ Subword balance, position indices and power sums ⋮ ON SUBWORD SYMMETRY OF WORDS ⋮ Unnamed Item ⋮ Subsequence Invariants ⋮ Binary Images, M −Vectors, and Ambiguity ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ On M-Equivalence and Strong M-Equivalence for Parikh Matrices ⋮ Relations on words ⋮ Kernel methods for learning languages ⋮ Generalizations of Parikh mappings ⋮ Subword histories and associated matrices ⋮ Criteria for the matrix equivalence of words ⋮ Connections between subwords and certain matrix mappings ⋮ SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES ⋮ Independence of certain quantities indicating subword occurrences ⋮ ON PARIKH MATRICES, AMBIGUITY, AND PRINTS ⋮ POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS ⋮ Absoluteness of subword inequality is undecidable ⋮ COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES ⋮ Parikh Matrices and Strong M-Equivalence ⋮ Parikh matrices for powers of words ⋮ TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES ⋮ A NOTE ON THE DECIDABILITY OF SUBWORD INEQUALITIES ⋮ Core words and Parikh matrices
Cites Work
This page was built for publication: Subword histories and Parikh matrices
