Title of article
Naive infinite enumeration of context-free languages in incremental polynomial time
Author/Authors
Florencio, Christophe Costa Katholieke Universiteit, Belgium , Daenen, Jonny Hasselt University, Belgium , Daenen, Jonny Transnational University of Limburg, Belgium , Ramon, Jan Katholieke Universiteit, Belgium , Van den Bussche, Jan Hasselt University, Belgium , Van den Bussche, Jan Transnational University of Limburg, Belgium , Van Dyck, Dries Belgian Nuclear Research Centre (SCK-CEN), Belgium
From page
891
To page
911
Abstract
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.
Keywords
Context , free grammar , Incremental polynomial time , Polynomial delay , Systematic generation
Journal title
Journal of J.UCS (Journal of Universal Computer Science)
Journal title
Journal of J.UCS (Journal of Universal Computer Science)
Record number
2715345
Link To Document