mlsanityData to 14 Oct 2026

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering

arXiv 1904.10703 ↗First posted 24 Apr 2019cs.LO cs.FLcited by 1

Not on the map. Why?

Abstract (arXiv)

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 sets. These algorithms can be built in a generic or parameterized way, in parallel with the way complex WQOs are obtained by combining or modifying simpler WQOs.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 24 Apr 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.

  1. 2024Directed Regular and Context-Free Languagescited by 0