Câmpeanu and Ho (2004) determined the maximum finite state complexity of finite languages, building on work of Champarnaud and Pin (1989). They stated that it is very difficult to determine the number of maximum-complexity languages. Here we give a formula for this number. We also generalize their work from languages to functions on finite sets.

中文翻译：

---

具有最大状态复杂度的语言数量

Câmpeanu 和 Ho (2004) 基于 Champarnaud 和 Pin (1989) 的工作确定了有限语言的最大有限状态复杂度。他们表示很难确定最大复杂度语言的数量。这里我们给出这个数字的公式。我们还将他们的工作从语言推广到有限集上的函数。