Generalizations of Parikh mappings
From MaRDI portal
Recommendations
Cites work
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- Comparing subword occurrences in binary D0L sequences
- Extending Parikh matrices
- scientific article; zbMATH DE number 993346 (Why is no real title available?)
- scientific article; zbMATH DE number 1735821 (Why is no real title available?)
- scientific article; zbMATH DE number 1740032 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- Independence of certain quantities indicating subword occurrences
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- On Context-Free Languages
- On fairness of D0L systems
- ON SUBWORD SYMMETRY OF WORDS
- Parikh matrices and amiable words
- Some characterizations of Parikh matrix equivalent binary words
- Subword balance in binary words, languages and sequences
- Subword histories and Parikh matrices
- The origins of combinatorics on words
- The Prouhet-Tarry-Escott problem revisited
- Theory Is Forever
Cited in
(11)- Parikh matrices for powers of words
- Core words and Parikh matrices
- Enriching Parikh matrix mappings
- A sharpening of the Parikh mapping
- Counting subwords using a trie automaton
- BINARY AMIABLE WORDS
- On Prouhet's solution to the equal powers problem
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
- scientific article; zbMATH DE number 2080937 (Why is no real title available?)
- Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms
- On core words and the Parikh matrix mapping
This page was built for publication: Generalizations of Parikh mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566349)