2 search results - page 1 / 1 » Deciding the finiteness of the number of simple permutations... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
TCS
2008
13 years 4 months ago
2008
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...