Linearizing well quasi-orders and bounding the length of bad sequences
type: Item
instance of: scholarly article
title: Linearizing well quasi-orders and bounding the length of bad sequences
zbMATH Open document ID: 1347.03086
author: Sergio Abriola
author: Santiago Figueira
author: Gabriel Senno
published in: Theoretical Computer Science
publication date: 2015-10-12T00:00:00Z
Mathematics Subject Classification ID: 03E05
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 6493328
zbMATH Keywords: well quasi-order
zbMATH Keywords: controlled bad sequence
zbMATH Keywords: lexicographic ordering
zbMATH Keywords: product ordering
zbMATH Keywords: multiset ordering
zbMATH Keywords: majoring ordering
zbMATH Keywords: fast growing hierarchy
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.07.012
OpenAlex ID: W1452987818
cites work: Ordering by Divisibility in Abstract Algebras
cites work: On Ordered Division Rings
cites work: Partial well‐ordering of sets of vectors
cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
cites work: Graph minors. XX: Wagner's conjecture
cites work: Q4385532
cites work: Q3696498
cites work: Using unavoidable set of trees to generalize Kruskal's theorem
cites work: Well rewrite orderings and well quasi-orderings
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: Q4228493
cites work: Ensuring completeness of symbolic verification methods for infinite-state systems
cites work: Well-structured transition systems everywhere!
cites work: Multiply-Recursive Upper Bounds with Higman’s Lemma
cites work: Hierarchies of number-theoretic functions. I
cites work: Alternating automata on data trees and XPath satisfiability
cites work: Petri nets and large finite sets
cites work: On the finite containment problem for Petri nets
cites work: Weak Bisimulation Approximants
cites work: Ordinal recursive bounds for Higman's theorem
cites work: Complexity bounds for some finite forms of Kruskal's theorem
cites work: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
cites work: Proving termination with multiset orderings
cites work: Q5533181
DOI: 10.1016/J.TCS.2015.07.012
description: scientific article; zbMATH DE number 6493328