Article
Licensed
Unlicensed
Requires Authentication
Counting Finite Languages by Total Word Length
-
Stefan Gerhold
Published/Copyright:
August 4, 2011
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 size and large total word length are discussed. Moreover, we derive a Gaussian limit law for the number of words in a random finite language.
Keywords.: Finite Languages; Saddle Point Method
Received: 2010-11-16
Revised: 2011-04-05
Accepted: 2011-04-28
Published Online: 2011-08-04
Published in Print: 2011-December
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Completely Multiplicative Automatic Functions
- The k-Periodic Fibonacci Sequence and an Extended Binet's Formula
- Robin's Theorem, Primes, and a New Elementary Reformulation of the Riemann Hypothesis
- Reducing the Erdős–Moser Equation 1n + 2n + ⋯ + kn = (k + 1)n Modulo k and k2
- On Some Conjectures Concerning Stern's Sequence and Its Twist
- Number of Weighted Subsequence Sums with Weights in {1, –1}
- Binomial Coefficient – Harmonic Sum Identities Associated to Supercongruences
- Euler's Pentagonal Number Theorem Implies the Jacobi Triple Product Identity
- On Directions Determined by Subsets of Vector Spaces over Finite Fields
- A Remark on a Paper of Luca and Walsh
- On the Tennis Ball Problem
- On the Conditioned Binomial Coefficients
- Convolution and Reciprocity Formulas for Bernoulli Polynomials
- Counting Finite Languages by Total Word Length
Articles in the same Issue
- Completely Multiplicative Automatic Functions
- The k-Periodic Fibonacci Sequence and an Extended Binet's Formula
- Robin's Theorem, Primes, and a New Elementary Reformulation of the Riemann Hypothesis
- Reducing the Erdős–Moser Equation 1n + 2n + ⋯ + kn = (k + 1)n Modulo k and k2
- On Some Conjectures Concerning Stern's Sequence and Its Twist
- Number of Weighted Subsequence Sums with Weights in {1, –1}
- Binomial Coefficient – Harmonic Sum Identities Associated to Supercongruences
- Euler's Pentagonal Number Theorem Implies the Jacobi Triple Product Identity
- On Directions Determined by Subsets of Vector Spaces over Finite Fields
- A Remark on a Paper of Luca and Walsh
- On the Tennis Ball Problem
- On the Conditioned Binomial Coefficients
- Convolution and Reciprocity Formulas for Bernoulli Polynomials
- Counting Finite Languages by Total Word Length
