Comparing subword occurrences in binary D0L sequences
From MaRDI portal
Publication:3401488
DOI10.1142/S0129054107005431zbMATH Open1183.68353MaRDI QIDQ3401488FDOQ3401488
Authors: Arto Salomaa 
Publication date: 29 January 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A sharpening of the Parikh mapping
- On Context-Free Languages
- Some characterizations of Parikh matrix equivalent binary words
- Subword histories and Parikh matrices
- Extending Parikh matrices
- Connections between subwords and certain matrix mappings
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- Subword conditions and subword histories
- Independence of certain quantities indicating subword occurrences
Cited In (12)
- Subword histories and associated matrices
- Maximal Words in Sequence Comparisons Based on Subword Composition
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
- Searching of Gapped Repeats and Subrepetitions in a Word
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subword balance in binary words, languages and sequences
- ON SUBWORD SYMMETRY OF WORDS
- Generalizations of Parikh mappings
- On fairness of D0L systems
- Algebraic properties of Parikh matrices of binary picture arrays
- On fair words
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)
