Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
From MaRDI portal
Publication:428858
DOI10.1016/j.tcs.2012.01.017zbMath1276.68096OpenAlexW2041215457MaRDI QIDQ428858
Publication date: 25 June 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.017
Cites Work
- Criteria for the matrix equivalence of words
- The generating function of the number of subpatterns of a DOL sequence
- Sur les séries associees à certains systèmes de Lindenmayer
- Subword histories and Parikh matrices
- Extending Parikh matrices
- Subword balance, position indices and power sums
- On fairness of D0L systems
- A sharpening of the Parikh mapping
- COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES
- Generalizations of Parikh mappings
- SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism