Enriching Parikh matrix mappings
From MaRDI portal
Publication:2852109
DOI10.1080/00207160.2012.742243zbMath1273.68285OpenAlexW2063698364MaRDI QIDQ2852109
Radu Atanasiu, Adrian Atanasiu
Publication date: 8 October 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.742243
Combinatorics in computer science (68R05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Determinants, permanents, traces, other special matrix functions (15A15)
Related Items (3)
Parikh matrices for powers of words ⋮ On Core Words and the Parikh Matrix Mapping ⋮ Core words and Parikh matrices
Cites Work
- Some characterizations of Parikh matrix equivalent binary words
- Subword histories and associated matrices
- Criteria for the matrix equivalence of words
- Parikh matrices and amiable words
- Connections between subwords and certain matrix mappings
- Independence of certain quantities indicating subword occurrences
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- PARIKH MATRIX MAPPING AND LANGUAGES
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- On Context-Free Languages
This page was built for publication: Enriching Parikh matrix mappings