Pages that link to "Item:Q2554710"
From MaRDI portal
The following pages link to The theory of well-quasi-ordering: a frequently discovered concept (Q2554710):
Displaying 50 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- The Möbius function of generalized subword order (Q409623) (← links)
- Fine hierarchies via Priestley duality (Q424549) (← links)
- On structural descriptions of lower ideals of series parallel posets (Q466868) (← links)
- The behavior of ascending chain conditions on submodules of bounded finite generation in direct sums (Q502986) (← links)
- An order-theoretic characterization of the Howard-Bachmann-hierarchy (Q512137) (← links)
- Well-quasi-order of relabel functions (Q603891) (← links)
- Definability in the structure of words with the inclusion relation (Q606049) (← links)
- The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
- Embedding dualities for set partitions and for relational structures (Q648966) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- Finite Gröbner bases in infinite dimensional polynomial rings and applications (Q655333) (← links)
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Partial orders on words, minimal elements of regular languages, and state complexity (Q688156) (← links)
- Well quasi-orders and context-free grammars (Q703570) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Deciding branching time properties for asynchronous programs (Q732003) (← links)
- On regularity of context-free languages (Q759489) (← links)
- Ordered sets with no chains of ideals of a given type (Q762508) (← links)
- Combinatorial properties of regressive mappings (Q791524) (← links)
- A note on off-line machines with 'Brownian' input heads (Q801900) (← links)
- Learning languages in a union (Q859985) (← links)
- Finite automata and algebraic extensions of functions fields (Q873839) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Theory of interaction (Q896903) (← links)
- On block pumpable languages (Q897892) (← links)
- Corrigendum to: ``Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals'' (Q898290) (← links)
- On well-quasi-ordering finite structures with labels (Q912875) (← links)
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- Generalizations of Khovanskiĭ's theorems on the growth of sumsets in abelian semigroups (Q928780) (← links)
- The finite antichain property in Coxeter groups. (Q942014) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- On canonical antichains (Q1011785) (← links)
- A new class of unique product monoids with applications to ring theory. (Q1014250) (← links)
- Definability in the \(h\)-quasiorder of labeled forests (Q1023296) (← links)
- A regularity test for dual bordered OS systems (Q1060851) (← links)
- Une généralisation des théorèmes de Higman et de Simon aux mots infinis (Q1062465) (← links)
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets) (Q1066924) (← links)
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\) (Q1069312) (← links)
- Some quasi-ordered classes of finite commutative semigroups (Q1071109) (← links)
- On total regulators generated by derivation relations (Q1084874) (← links)
- Termination of rewriting (Q1098624) (← links)
- On well-quasi-ordering-finite graphs by immersion (Q1104345) (← links)
- A notion of branching rank for semilattices with descending chain condition (Q1110547) (← links)
- Using unavoidable set of trees to generalize Kruskal's theorem (Q1122597) (← links)
- Inventories of unavoidable languages and the word-extension conjecture (Q1129010) (← links)
- Basic formulas and languages. I: The theory (Q1166275) (← links)
- Basic formulas and languages. II: Applications to EOL systems and forms (Q1166276) (← links)
