|
|
|
|
Naive infinite enumeration of context-free languages in incremental polynomial time
|
|
|
|
|
|
|
|
نویسنده
|
Florencio Christophe Costa ,Daenen Jonny ,Ramon Jan ,Van den Bussche Jan ,Van Dyck Dries
|
|
منبع
|
journal of universal computer science - 2015 - دوره : 21 - شماره : 7 - صفحه:891 -911
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Context-free grammar; Incremental polynomial time; Polynomial delay; Systematic generation
|
|
آدرس
|
Katholieke Universiteit, Belgium, Hasselt University, Belgium. Transnational University of Limburg, Belgium, Katholieke Universiteit, Belgium, Hasselt University, Belgium. Transnational University of Limburg, Belgium, Belgian Nuclear Research Centre (SCK-CEN), Belgium
|
|
پست الکترونیکی
|
vandyck.dries@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|