Comparing subword occurrences in binary D0L sequences
From MaRDI portal
Publication:3401488
Recommendations
Cites work
- scientific article; zbMATH DE number 3802813 (Why is no real title available?)
- A sharpening of the Parikh mapping
- Connections between subwords and certain matrix mappings
- Extending Parikh matrices
- Independence of certain quantities indicating subword occurrences
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- On Context-Free Languages
- Some characterizations of Parikh matrix equivalent binary words
- Subword conditions and subword histories
- Subword histories and Parikh matrices
Cited in
(13)- Equality sets of binary D0L sequences
- On fairness of D0L systems
- Subword histories and associated matrices
- ON SUBWORD SYMMETRY OF WORDS
- Algebraic properties of Parikh matrices of binary picture arrays
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
- scientific article; zbMATH DE number 1285631 (Why is no real title available?)
- Maximal Words in Sequence Comparisons Based on Subword Composition
- scientific article; zbMATH DE number 1740040 (Why is no real title available?)
- Subword balance in binary words, languages and sequences
- Generalizations of Parikh mappings
- On fair words
- Searching of Gapped Repeats and Subrepetitions in a Word
This page was built for publication: Comparing subword occurrences in binary D0L sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401488)
