Counting Finite Languages by Total Word Length
Stefan Gerhold

TL;DR
This paper explores the enumeration of finite languages based on total word length, providing explicit formulas, asymptotic analysis, and a Gaussian limit law for the number of words.
Contribution
It introduces an explicit counting formula, asymptotic results, and a probabilistic limit law for finite languages by total word length.
Findings
Derived explicit expression for the counting sequence.
Established asymptotic behavior for large alphabet and total length.
Proved a Gaussian limit law for the number of words in a random finite language.
Abstract
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and asymptotics for large alphabet respectively large total word length are discussed. Moreover, we derive a Gaussian limit law for the number of words in a random finite language.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
