On the least exponential growth admitting uncountably many closed permutation classes

Martin Klazar. On the least exponential growth admitting uncountably many closed permutation classes. Theoretical Computer Science, 321(2-3):271-281, 2004. [doi]

No reviews for this publication, yet.