Generalized Parikh matrices for tracking subsequence occurrences
From MaRDI portal
Cites work
- \(\langle\mathbb{R},+,<,1\rangle\) is decidable in \(\langle \mathbb{R},+,<,\mathbb{Z}\rangle\)
- M-equivalence of Parikh matrix over a ternary alphabet
- A compactness property of the \(k\)-abelian monoids
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- Connections between subwords and certain matrix mappings
- Core words and Parikh matrices
- Criteria for the matrix equivalence of words
- Extending Parikh matrices
- Matching patterns with variables under Simon's congruence
- On Context-Free Languages
- On the Simon's congruence neighborhood of languages
- Ordering by Divisibility in Abstract Algebras
- Parikh matrices and amiable words
- Parikh matrices and Parikh rewriting systems
- Separability by piecewise testable languages and downward closures beyond subwords
- Simon's congruence pattern matching
- Some characterizations of Parikh matrix equivalent binary words
- Subsequences with gap constraints: complexity bounds for matching and analysis problems
- Subsequences with generalised gap constraints: upper and lower complexity bounds
- Subword histories and associated matrices
- Subword histories and Parikh matrices
- The complexity of downward closure comparisons
This page was built for publication: Generalized Parikh matrices for tracking subsequence occurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979823)
