Pages that link to "Item:Q2255003"

The following pages link to An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003):

Displaying 9 items.

• An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
• Characterising inflations of monotone grid classes of permutations (Q1679336) (← links)
• Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
• A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
• An algebraic approach for the search space of permutations with repetition (Q2057112) (← links)
• Universal limits of substitution-closed permutation classes (Q2216743) (← links)
• Simple permutations: Decidability and unavoidable substructures (Q2474234) (← links)
• Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial (Q2915601) (← links)
• Automatic discovery of structural rules of permutation classes (Q4629385) (← links)