Numeration and enumeration
DOI10.1016/J.EJC.2012.03.017zbMATH Open1280.11006OpenAlexW2016243252MaRDI QIDQ444411FDOQ444411
Authors: Daniele A. Gewurz, Francesca Merola
Publication date: 14 August 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.03.017
Recommendations
numeration systemsrecurrent sequencesenumeration of wordsforbidden substrings/factorsgreedy expansionslazy expansions
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Other number representations (11A67)
Cites Work
Cited In (17)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- String Attractors of Fixed Points of k-Bonacci-Like Morphisms
- Generalized Lyndon factorizations of infinite words
- Counting and Numbers, from Pure Mathesis to Base Conversion Algorithms
- Title not available (Why is that?)
- Integer word recurrences and integer sequences
- Precomplete numberings
- Title not available (Why is that?)
- Enumerations including laconic enumerators
- Enumeration (18th–20th centuries)
- Numeration systems and fractal sequences
- String attractors of some simple-parry automatic sequences
- Reprint of: ``Generalized Lyndon factorizations of infinite words
- Completeness of positive linear recurrence sequences
- Regular enumerations
- An Introduction to Enumeration
- Inverse Lyndon words and inverse Lyndon factorizations of words
This page was built for publication: Numeration and enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444411)