WQO is decidable for factorial languages (Q2407108): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2743994595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially well-ordered closed sets of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelled induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding WQO for Factorial Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations: Decidability and unavoidable substructures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal antichains in well-founded quasi-orders with an application to tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and forbidden words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi-orders and regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: When excluding one matroid prevents infinite antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two forbidden induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter graphs and well-quasi-order by induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite antichain of permutations / rank
 
Normal rank

Latest revision as of 12:13, 14 July 2024

scientific article
Language Label Description Also known as
English
WQO is decidable for factorial languages
scientific article

    Statements

    WQO is decidable for factorial languages (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2017
    0 references
    well-quasi-ordering
    0 references
    factorial language
    0 references
    polynomial-time algorithm
    0 references
    induced subgraph
    0 references
    permutation
    0 references

    Identifiers