107 citations · 401 across the 20 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.LO2010★ 107 cited
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
Diego Figueira, Santiago Figueira, Sylvain Schmitz +1
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists…
cs.FL2010★ 5 cited
Toward a Compositional Theory of Leftist Grammars and Transformations
Pierre Chambart, Philippe Schnoebelen
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor…