Counting Finite Languages by Total Word Length
From MaRDI portal
Publication:3108546
DOI10.1515/INTEG.2011.068zbMath1234.05024arXiv1001.4392OpenAlexW2963085623MaRDI QIDQ3108546
Publication date: 4 January 2012
Published in: Integers (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.4392
asymptoticsgenerating functionsaddle point methodfinite alphabetfinite languageslength of wordssets of words
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)
Related Items (2)
Difference Equation Theory Meets Mathematical Finance ⋮ How to make Dupire’s local volatility work with jumps
This page was built for publication: Counting Finite Languages by Total Word Length