102
Voted
TCS
2008
15 years 1 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 ...