WQO is decidable for factorial languages (Q2407108)

From MaRDI portal
Revision as of 23:04, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
WQO is decidable for factorial languages
scientific article

    Statements

    title
    WQO is decidable for factorial languages (English)
    0 references
    author
    Aistis Atminas
    0 references
    Vadim V. Lozin
    0 references
    Mikhail Ju. Moshkov
    0 references
    publication date
    28 September 2017
    0 references
    zbMATH Keywords
    well-quasi-ordering
    0 references
    factorial language
    0 references
    polynomial-time algorithm
    0 references
    induced subgraph
    0 references
    permutation
    0 references

    Identifiers

    zbMATH DE Number
    6782892
    0 references
    OpenAlex ID
    W2743994595
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2407108&oldid=32098072"
    Powered by MediaWiki