Connections between subwords and certain matrix mappings
From MaRDI portal
Publication:2484434
Recommendations
Cites work
- A sharpening of the Parikh mapping
- Characterization of a word by its subwords
- Extending Parikh matrices
- scientific article; zbMATH DE number 5604082 (Why is no real title available?)
- scientific article; zbMATH DE number 5604096 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (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?)
- scientific article; zbMATH DE number 1408358 (Why is no real title available?)
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- On Context-Free Languages
- Reconstruction from subsequences.
- Some characterizations of Parikh matrix equivalent binary words
- Subword histories and Parikh matrices
- Theory Is Forever
- Words and special factors
Cited in
(41)- On highly palindromic words
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Subword histories and Parikh matrices
- Subword balance, position indices and power sums
- Independence of certain quantities indicating subword occurrences
- Absent subsequences in words
- Separability of M-equivalent words by morphisms
- Parikh matrices and strong M-equivalence
- Enriching Parikh matrix mappings
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- PARIKH MATRIX MAPPING AND LANGUAGES
- Parikh matrices, amiability and Istrail morphism
- Power sums associated with certain recursive procedures on words
- Comparing subword occurrences in binary D0L sequences
- scientific article; zbMATH DE number 5074393 (Why is no real title available?)
- ON INEQUALITIES BETWEEN SUBWORD HISTORIES
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- ON PARIKH MATRICES
- scientific article; zbMATH DE number 5635797 (Why is no real title available?)
- On M-equivalence and strong M-equivalence for Parikh matrices
- Scattered Factor-Universality of Words
- Relations on words
- Subword occurrences, Parikh matrices and Lyndon images
- Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
- Absent Subsequences in Words
- Longest Common Subsequence with Gap Constraints
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity
- Subsequences in bounded ranges: matching and analysis problems
- Combinatorial algorithms for subsequence matching: a survey
- Subsequences with generalised gap constraints: upper and lower complexity bounds
- Ternary is still good for Parikh matrices
- The edit distance to k-subsequence universality
- Longest common subsequence with gap constraints
- Generalized Parikh matrices for tracking subsequence occurrences
- The edit distance to \(k\)-subsequence universality
- Efficiently testing Simon's congruence
- Subsequence matching and analysis problems for formal languages
- Linear time subsequence and supersequence regex matching
- Subword conditions and subword histories
- Subword histories and associated matrices
- Criteria for the matrix equivalence of words
This page was built for publication: Connections between subwords and certain matrix mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484434)
