Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
From MaRDI portal
Publication:428858
DOI10.1016/J.TCS.2012.01.017zbMATH Open1276.68096OpenAlexW2041215457MaRDI QIDQ428858FDOQ428858
Authors: Arto Salomaa
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
Recommendations
Cites Work
- Title not available (Why is that?)
- A sharpening of the Parikh mapping
- Criteria for the matrix equivalence of words
- Subword histories and Parikh matrices
- Title not available (Why is that?)
- Extending Parikh matrices
- Generalizations of Parikh mappings
- The generating function of the number of subpatterns of a DOL sequence
- Sur les séries associees à certains systèmes de Lindenmayer
- Subword balance, position indices and power sums
- On fairness of D0L systems
- Comparing subword occurrences in binary D0L sequences
- Subword balance in binary words, languages and sequences
- Title not available (Why is that?)
- Subword occurrences, Parikh matrices and Lyndon images
Cited In (5)
This page was built for publication: Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428858)