Pages that link to "Item:Q3012939"
From MaRDI portal
The following pages link to Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939):
Displaying 17 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Generalized Post embedding problems (Q2354596) (← links)
- On the quantifier-free dynamic complexity of reachability (Q2514150) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Nondeterministic Ordered Restarting Automata (Q3177341) (← links)
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders (Q3295145) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- (Q5009453) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)
- Parameterized broadcast networks with registers: from NP to the frontiers of decidability (Q6629529) (← links)
