Reducing the ambiguity of Parikh matrices
From MaRDI portal
Publication:5918142
DOI10.1016/j.tcs.2021.01.025zbMath1497.68401OpenAlexW4206932127MaRDI QIDQ5918142
Jeffery Dick, Laura K. Hutchinson, Daniel Reidenbach, Robert Mercaş
Publication date: 9 March 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/Reducing_the_ambiguity_of_Parikh_matrices/11297906
Related Items (3)
A toolkit for Parikh matrices ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Erasure and error correcting ability of Parikh matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Several extensions of the Parikh matrix \(L\)-morphism
- Some characterizations of Parikh matrix equivalent binary words
- Extending Parikh matrices
- Parikh matrices and amiable words
- PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
- A sharpening of the Parikh mapping
- COUNTING SUBWORDS USING A TRIE AUTOMATON
- Some Algebraic Aspects of Parikh q-Matrices
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
- Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence
- A New Operator over Parikh Languages
- On Context-Free Languages
This page was built for publication: Reducing the ambiguity of Parikh matrices
