Recommendations
Cites work
- scientific article; zbMATH DE number 5074393 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2182445 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A sharpening of the Parikh mapping
- Comparing subword occurrences in binary D0L sequences
- Connections between subwords and certain matrix mappings
- Extending Parikh matrices
- Independence of certain quantities indicating subword occurrences
- Injectivity of the Parikh matrix mappings revisited
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- ON INEQUALITIES BETWEEN SUBWORD HISTORIES
- On fairness of D0L systems
- Parikh matrices and amiable words
- Some characterizations of Parikh matrix equivalent binary words
- Subword balance in binary words, languages and sequences
- Subword conditions and subword histories
- Subword histories and Parikh matrices
Cited in
(20)- Scattered subwords and composition of natural numbers
- Erasure and error correcting ability of Parikh matrices
- Subword occurrences, Parikh matrices and Lyndon images
- Order of weak \(M\)-relation and Parikh matrices
- Binary images, \(M\)-vectors, and ambiguity
- Two-dimensional digitized picture arrays and Parikh matrices
- PARIKH MATRIX MAPPING AND LANGUAGES
- Independence of certain quantities indicating subword occurrences
- Enriching Parikh matrix mappings
- Subword balance, position indices and power sums
- Core words and Parikh matrices
- ON INEQUALITIES BETWEEN SUBWORD HISTORIES
- scientific article; zbMATH DE number 5635797 (Why is no real title available?)
- Subword conditions and subword histories
- On core words and the Parikh matrix mapping
- Absoluteness of subword inequality is undecidable
- Subword histories and Parikh matrices
- Counting subwords using a trie automaton
- Parikh matrices and strong \(M\)-equivalence
- Criteria for the matrix equivalence of words
This page was built for publication: Subword histories and associated matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954996)
