Linearizing well quasi-orders and bounding the length of bad sequences (Q744984): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1452987818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ordered Division Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial well‐ordering of sets of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3696498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using unavoidable set of trees to generalize Kruskal's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well rewrite orderings and well quasi-orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ensuring completeness of symbolic verification methods for infinite-state systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply-Recursive Upper Bounds with Higman’s Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic functions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on data trees and XPath satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and large finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite containment problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Bisimulation Approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal recursive bounds for Higman's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for some finite forms of Kruskal's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533181 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:58, 10 July 2024

scientific article
Language Label Description Also known as
English
Linearizing well quasi-orders and bounding the length of bad sequences
scientific article

    Statements

    Linearizing well quasi-orders and bounding the length of bad sequences (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2015
    0 references
    well quasi-order
    0 references
    controlled bad sequence
    0 references
    lexicographic ordering
    0 references
    product ordering
    0 references
    multiset ordering
    0 references
    majoring ordering
    0 references
    fast growing hierarchy
    0 references

    Identifiers