Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0304-3975(03)00215-9
DC FieldValue
dc.titleA new algorithm for regularizing one-letter context-free grammars
dc.contributor.authorAndrei, S.
dc.contributor.authorCavadini, S.V.
dc.contributor.authorChin, W.-N.
dc.date.accessioned2013-07-23T09:26:21Z
dc.date.available2013-07-23T09:26:21Z
dc.date.issued2003
dc.identifier.citationAndrei, S., Cavadini, S.V., Chin, W.-N. (2003). A new algorithm for regularizing one-letter context-free grammars. Theoretical Computer Science 306 (1-3) : 113-122. ScholarBank@NUS Repository. https://doi.org/10.1016/S0304-3975(03)00215-9
dc.identifier.issn03043975
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/43149
dc.description.abstractConstructive methods for obtaining regular grammar counterparts for some sub-classes of context-free grammars (CFGs) have been investigated by many researchers. An important class of grammars for which this is always possible is the one-letter CFG. We show in this paper a new constructive method for transforming an arbitrary one-letter CFG to an equivalent regular expression of star-height 0 or 1. Our new result is considerably simpler than a previous construction by Leiss, and we also propose a new normal form for a regular expression with only a single-star occurrence. Through an alphabet factorization theorem, we show how to go beyond the one-letter CFG in a straight-forward way. © 2003 Elsevier B.V. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/S0304-3975(03)00215-9
dc.sourceScopus
dc.subjectOne-letter context-free language
dc.subjectReduction of a context-free grammar
dc.subjectRegular expression
dc.typeArticle
dc.contributor.departmentSINGAPORE-MIT ALLIANCE
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1016/S0304-3975(03)00215-9
dc.description.sourcetitleTheoretical Computer Science
dc.description.volume306
dc.description.issue1-3
dc.description.page113-122
dc.description.codenTCSCD
dc.identifier.isiut000185261500008
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

6
checked on Dec 1, 2022

WEB OF SCIENCETM
Citations

6
checked on Nov 23, 2022

Page view(s)

213
checked on Nov 24, 2022

Google ScholarTM

Check

Altmetric


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