Directional counting for regular languages

2023/11/17 by Grigorchuk, Rostislav, Quint, Jean-François
#05A16 #05C30 #32A10 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2311.10532

Abstract

We explain how certain tools from convex analysis and probability theory may be used in order to obtain counting results for the number of words with prescribed frequencies of letters in regular languages.

Related

• Enumerating regular languages in radix order : Revisiting the Ackerman-Shallit algorithm
• Counting Finite Languages by Total Word Length
• Counting Subwords and Regular Languages
• Counting words without non-decreasing subwords of fixed length
• Weighted Automata and Recurrence Equations for Regular Languages