The number of languages with maximum state complexity

IF 0.6 4区数学 Q3 MATHEMATICS

Algebra Universalis Pub Date : 2022-07-30 DOI:10.1007/s00012-022-00785-2

Bjørn Kjos-Hanssen, Lei Liu

引用次数: 1

Abstract

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.

Abstract Image

查看原文本刊更多论文

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

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

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Algebra Universalis 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3 months

期刊介绍： Algebra Universalis publishes papers in universal algebra, lattice theory, and related fields. In a pragmatic way, one could define the areas of interest of the journal as the union of the areas of interest of the members of the Editorial Board. In addition to research papers, we are also interested in publishing high quality survey articles.