Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/19674
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFlorencio, Christophe Costa-
dc.contributor.authorDAENEN, Jonny-
dc.contributor.authorRamon, Jan-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.authorVAN DYCK, Dries-
dc.date.accessioned2015-10-06T12:09:44Z-
dc.date.available2015-10-06T12:09:44Z-
dc.date.issued2015-
dc.identifier.citationJOURNAL OF UNIVERSAL COMPUTER SCIENCE, 21 (7), p. 891-911-
dc.identifier.issn0948-695X-
dc.identifier.urihttp://hdl.handle.net/1942/19674-
dc.description.abstractWe 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.-
dc.language.isoen-
dc.publisherGRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS COMPUTER MEDIA-IICM-
dc.subject.othercontext-free grammar; systematic generation; polynomial time-
dc.subject.othercontext-free grammar; systematic generation; incremental polynomial time; polynomial delay-
dc.titleNaive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time-
dc.typeJournal Contribution-
dc.identifier.epage911-
dc.identifier.issue7-
dc.identifier.spage891-
dc.identifier.volume21-
local.format.pages21-
local.bibliographicCitation.jcatA1-
dc.description.notes[Florencio, Christophe Costa; Ramon, Jan] Katholieke Univ Leuven, Leuven, Belgium. [Daenen, Jonny; Van den Bussche, Jan] Hasselt Univ, Hasselt, Belgium. [Daenen, Jonny; Van den Bussche, Jan] Transnat Univ Limburg, Limburg, Belgium. [Van Dyck, Dries] Belgian Nucl Res Ctr SCK CEN, BE-2400 Mol, Belgium.-
local.publisher.placeGRAZ-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.identifier.isi000358989800002-
item.validationecoom 2016-
item.accessRightsOpen Access-
item.fullcitationFlorencio, Christophe Costa; DAENEN, Jonny; Ramon, Jan; VAN DEN BUSSCHE, Jan & VAN DYCK, Dries (2015) Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time. In: JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 21 (7), p. 891-911.-
item.fulltextWith Fulltext-
item.contributorFlorencio, Christophe Costa-
item.contributorDAENEN, Jonny-
item.contributorRamon, Jan-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorVAN DYCK, Dries-
crisitem.journal.issn0948-695X-
crisitem.journal.eissn0948-6968-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
authorversion.pdf385.88 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.