Pages that link to "Item:Q1878676"
From MaRDI portal
The following pages link to Subword histories and Parikh matrices (Q1878676):
Displaying 41 items.
- On computational complexity of graph inference from counting (Q269786) (← links)
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism (Q428858) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Relations on words (Q505060) (← links)
- Absoluteness of subword inequality is undecidable (Q764348) (← links)
- Some characterizations of Parikh matrix equivalent binary words (Q834899) (← links)
- Subword conditions and subword histories (Q859831) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- Subword histories and associated matrices (Q954996) (← links)
- Criteria for the matrix equivalence of words (Q964400) (← links)
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices (Q1704577) (← links)
- Extending Parikh matrices (Q1884973) (← links)
- Subword balance, position indices and power sums (Q1959432) (← links)
- Parikh matrices for powers of words (Q2317835) (← links)
- Core words and Parikh matrices (Q2342671) (← links)
- On fairness of D0L systems (Q2381541) (← links)
- Connections between subwords and certain matrix mappings (Q2484434) (← links)
- Independence of certain quantities indicating subword occurrences (Q2508977) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Parikh matrices and strong \(M\)-equivalence (Q2833541) (← links)
- Two-dimensional digitized picture arrays and Parikh matrices (Q2856011) (← links)
- A note on the decidability of subword inequalities (Q2856016) (← links)
- Product of Parikh matrices and commutativity (Q2909192) (← links)
- Binary Images, M −Vectors, and Ambiguity (Q3003539) (← links)
- POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS (Q3076618) (← links)
- COUNTING SUBWORDS USING A TRIE AUTOMATON (Q3173481) (← links)
- Some Algebraic Aspects of Parikh <i>q</i>-Matrices (Q3186050) (← links)
- COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES (Q3401488) (← links)
- ON INEQUALITIES BETWEEN SUBWORD HISTORIES (Q3526551) (← links)
- ON SUBWORD SYMMETRY OF WORDS (Q3532154) (← links)
- Subsequence Invariants (Q3541017) (← links)
- Generalizations of Parikh mappings (Q3566349) (← links)
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS (Q3620619) (← links)
- On M-Equivalence and Strong M-Equivalence for Parikh Matrices (Q4639934) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Context-Freeness of Word-MIX Languages (Q5041269) (← links)
- SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES (Q5187854) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Ranking and Unranking k-Subsequence Universal Words (Q6134861) (← links)
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity (Q6163620) (← links)
- Counting subwords in circular words and their Parikh matrices (Q6185846) (← links)
