The number of languages with maximum state complexity
Formal Languages and Automata Theory
2022-05-03 v2 Combinatorics
Logic
Abstract
C\^{a}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.
Cite
@article{arxiv.1902.00815,
title = {The number of languages with maximum state complexity},
author = {Bjørn Kjos-Hanssen and Lei Liu},
journal= {arXiv preprint arXiv:1902.00815},
year = {2022}
}
Comments
Algebra Universalis, accepted for publication. Preliminary version in: Theory and Applications of Models of Computation (TAMC) 2019. Lecture Notes in Computer Science 11436 (2019)