Multiply-Recursive Upper Bounds with Higman’s Lemma

This publication has 16 references indexed in Scilit:

• Pumping and Counting on the Regular Post Embedding Problem
  Lecture Notes in Computer Science, 2010
• Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
  Lecture Notes in Computer Science, 2007
• A classification of symbolic transition systems
  ACM Transactions on Computational Logic, 2005
• Well-structured transition systems everywhere!
  Theoretical Computer Science, 2001
• Algorithmic Analysis of Programs with Well Quasi-ordered Domains
  Information and Computation, 2000
• Ordinal recursive bounds for Higman's theorem
  Theoretical Computer Science, 1998
• A Uniform Approach to Fundamental Sequences and Hierarchies
  Mathematical Logic Quarterly, 1994
• On the finite containment problem for Petri nets
  Theoretical Computer Science, 1986
• Well-partial orderings and hierarchies
  Indagationes Mathematicae, 1977
• The theory of well-quasi-ordering: A frequently discovered concept
  Journal of Combinatorial Theory, Series A, 1972