Counting Finite Languages by Total Word Length

Details Counting Finite Languages by Total Word Length Counting Finite Languages by Total Word Length

2010-01-25

arxiv.org/abs/1001.4392v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Counting Finite Languages by Total Word Length does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Finite Languages by Total Word Length, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Finite Languages by Total Word Length will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-130756