非置换变换半群及其在句法复杂性中的应用
On nonpermutational transformation semigroups with an application to syntactic complexity
摘要:
给出了$n$元上全变换半群的子半群的可能最大尺寸的$n((n-1)!-(n-3)!)$的一个上界.作为应用,我们也得到了(广义)定语言的句法复杂度的上界。
英文摘要:
We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same upper bound for the syntactic complexity of (generalized) definite languages as well.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。