Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/19674
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Florencio, Christophe Costa | - |
dc.contributor.author | DAENEN, Jonny | - |
dc.contributor.author | Ramon, Jan | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.contributor.author | VAN DYCK, Dries | - |
dc.date.accessioned | 2015-10-06T12:09:44Z | - |
dc.date.available | 2015-10-06T12:09:44Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 21 (7), p. 891-911 | - |
dc.identifier.issn | 0948-695X | - |
dc.identifier.uri | http://hdl.handle.net/1942/19674 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.publisher | GRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS COMPUTER MEDIA-IICM | - |
dc.subject.other | context-free grammar; systematic generation; polynomial time | - |
dc.subject.other | context-free grammar; systematic generation; incremental polynomial time; polynomial delay | - |
dc.title | Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 911 | - |
dc.identifier.issue | 7 | - |
dc.identifier.spage | 891 | - |
dc.identifier.volume | 21 | - |
local.format.pages | 21 | - |
local.bibliographicCitation.jcat | A1 | - |
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.place | GRAZ | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.isi | 000358989800002 | - |
item.validation | ecoom 2016 | - |
item.accessRights | Open Access | - |
item.fullcitation | Florencio, 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.fulltext | With Fulltext | - |
item.contributor | Florencio, Christophe Costa | - |
item.contributor | DAENEN, Jonny | - |
item.contributor | Ramon, Jan | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.contributor | VAN DYCK, Dries | - |
crisitem.journal.issn | 0948-695X | - |
crisitem.journal.eissn | 0948-6968 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
authorversion.pdf | 385.88 kB | Adobe PDF | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.