An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1307.2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations and pattern restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial specification of permutation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2915601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of pin-permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing simple permutations, with enumerative consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations and algebraic generating functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations: Decidability and unavoidable substructures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank

Latest revision as of 16:51, 9 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
scientific article

    Statements

    An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    permutation class
    0 references
    finite basis
    0 references
    simple permutation
    0 references
    automaton
    0 references
    pin-permutation
    0 references
    0 references
    0 references