107 citations · 401 across the 20 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering
Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar +2
Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these set…
cs.FL2019★ 4 cited
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
J. Leroux, M. Praveen, Ph. Schnoebelen +1
We consider numerical functions weakly computable by grammar-controlled vector addition systems (GVASes, a variant of pushdown Petri nets). GVASes can weakly compute all fast growi…