Pages that link to "Item:Q2554710"

The following pages link to The theory of well-quasi-ordering: a frequently discovered concept (Q2554710):

Displaying 50 items.

• 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)
• Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
• A Combinatorial Bound for a Restricted Form of the Termination Theorem (Q3295155) (← links)
• A Mechanized Proof of Higman’s Lemma by Open Induction (Q3295156) (← links)
• Well-Partial Orderings and their Maximal Order Types (Q3295157) (← links)
• The Valuation Difference Rank of a Quasi-Ordered Difference Field (Q3298267) (← links)
• Graph minor theory (Q3372389) (← links)
• Well quasi-orders, unavoidable sets, and derivation systems (Q3421904) (← links)
• On Von Neumann Regular Rings of Skew Generalized Power Series (Q3514818) (← links)
• Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
• Finite generation of symmetric ideals (Q3595013) (← links)
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor (Q3831057) (← links)
• Well-quasi-orderings and sets of finite sequences (Q4190679) (← links)
• Varieties of Commutative Semigroups (Q4292747) (← links)
• A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies (Q4305315) (← links)
• Foundations of BQO Theory (Q4316958) (← links)
• PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE (Q4528765) (← links)
• Towards a descriptive theory of cb₀-spaces (Q4593243) (← links)
• Degree Spectra of Relations on a Cone (Q4645836) (← links)
• Unavoidable languages, cuts and innocent sets of words (Q4858836) (← links)
• Ticket Entailment is decidable (Q4925031) (← links)
• Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms* (Q4988927) (← links)
• Testing hereditary properties of sequences (Q5002650) (← links)
• (Q5028432) (← links)
• There are exactly $\omega _1$ topological types of locally finite trees with countably many rays (Q5029032) (← links)
• Two Robots Patrolling on a Line: Integer Version and Approximability (Q5041191) (← links)
• Labelled well-quasi-order for permutation classes (Q5051473) (← links)
• E-Unification based on Generalized Embedding (Q5084482) (← links)
• (Q5090941) (← links)
• The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
• On Some Finitary Conditions Arising from the Axiomatisability of Certain Classes of Monoid Acts (Q5412099) (← links)
• On finite representations of infinite sequences of terms (Q5881270) (← links)
• Induced minors and well-quasi-ordering (Q5890902) (← links)
• Inductive inference of unbounded unions of pattern languages from positive data (Q5915396) (← links)
• Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
• Perfect failure detection with very few bits (Q5919048) (← links)
• Well-structured transition systems everywhere! (Q5941101) (← links)
• Generalizing Kruskal's theorem to pairs of cohabitating trees (Q5964929) (← links)
• Profunctors between posets and Alexander duality (Q6102160) (← links)
• On the logical strength of the better quasi order with three elements (Q6135847) (← links)
• Verification of data-aware process models: checking soundness of Data Petri nets (Q6197587) (← links)
• Well-quasi-ordering and Embeddability of Relational Structures (Q6493759) (← links)
• Process equivalence problems as energy games (Q6535628) (← links)
• Topology on semi-well ordered sets (Q6557989) (← links)
• Regularity of twisted partial skew generalized power series (Q6561433) (← links)
• Critical observations in model-based diagnosis (Q6566643) (← links)
• Characterization of ordered semigroups generating well quasi-orders of words (Q6580076) (← links)
• Equivariant lattice bases (Q6582248) (← links)
• The logical strength of minimal bad arrays (Q6658147) (← links)