The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Simon Halfon / rank
Normal rank
 
Property / author
 
Property / author: Prateek Karandikar / rank
Normal rank
 
Property / author
 
Property / author: Philippe Schnoebelen / rank
Normal rank
 
Property / author
 
Property / author: Simon Halfon / rank
 
Normal rank
Property / author
 
Property / author: Prateek Karandikar / rank
 
Normal rank
Property / author
 
Property / author: Philippe Schnoebelen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2941511937 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1904.10703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed lossy channel systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using forward reachability analysis for verification of lossy channel systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems: order types, continuous nondeterministic deformations, and quasi-orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable fixpoints in well-structured symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5367063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling infinitely branching well-structured transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free differential calculus. IV: The quotient groups of the lower central series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well Quasi-orders in Formal Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ideal theory for WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward Analysis for WSTS, Part II: Complete WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expand, enlarge and check: new algorithms for the coverability problem of WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Piecewise Testable Separability for Regular Tree Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Priority Channel Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Downward-Closure of Petri Net Languages / 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: On free monoids partially ordered by embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on well quasi-orderings for powersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une extension d'un théorème de P. Jullien sur les âges de mots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On well-quasi-ordering finite structures with labels / 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: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ideal view on Rackoff's coverability technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coverability in ν-Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demystifying Reachability in Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal arithmetic: Algorithms and mechanization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine analysis of the quasi-orderings on the power set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic, semigroups and automata on words / 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: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Bounds for Ordinal-Based Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Hierarchies beyond Elementary / 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: The Power of Well-Structured Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The residue of vector sets with applications to decidability problems in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Downward Closures for Stacked Counter Automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:17, 23 July 2024

scientific article
Language Label Description Also known as
English
The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
scientific article

    Statements

    The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 July 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers