107 citations · 401 across the 20 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.LO2011★ 5 cited
Generalized Post Embedding Problems
Prateek Karandikar, Philippe Schnoebelen
The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining dire…
cs.LO2011★ 60 cited
Multiply-Recursive Upper Bounds with Higman's Lemma
Sylvain Schmitz, Philippe Schnoebelen
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman's Lemma. This leads to tight multiply-recursive upper bounds that readi…