判定环闭类中所含单置换个数的有限性是多项式的
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
摘要：
给出了一个时间复杂度为O（nlnn）的算法，该算法判定由有限基B给出的环闭置换类Av（B）是否包含有限个简单置换.我们使用的方法是基于Brignall，Ruskuc和Vatter的一篇文章，其中提出了一个解决这个问题的决策过程（高复杂性），而不假设Av（B）是花环封闭的。使用组合，算法和语言理论的参数与我们以前的结果之一，针排列，我们能够将问题转化为一个有限性问题，在一个完整的确定性自动机。
英文摘要：
We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations. The method we use is based on an article of Brignall, Ruskuc and Vatter which presents a decision procedure (of high complexity) for solving this question, without the assumption that Av(B) is wreath-closed. Using combinatorial, algorithmic and language theoretic arguments together with one of our previous results on pin-permutations, we are able to transform the problem into a co-finiteness problem in a complete deterministic automaton.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
