Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time
Christophe Costa Florêncio, Dries Van Dyck, Jan Ramon, Jan Van den Bussche, Jonny Daenen · Lirias · 2020
We consider the naive bottom-up concatenation scheme for a context-free language and show that this scheme has the incremental polynomial time property. This means that all members of the language can be enumerated without duplicates so that the time between two consecutive outputs is bounded by a polynomial in the number of strings already generated.