| dc.contributor.author | Andrei, Å tefan | |
| dc.contributor.author | Chin, Wei Ngan | |
| dc.date.accessioned | 2003-12-13T19:34:32Z | |
| dc.date.available | 2003-12-13T19:34:32Z | |
| dc.date.issued | 2004-01 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/3865 | |
| dc.description.abstract | Constructive methods for obtaining the regular grammar counterparts for some sub-classes of the context free grammars (cfg) 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 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 single-star occurrence. Through an alphabet factorization theorem, we show how to go beyond the one-letter cfg in a straight-forward way. | en |
| dc.description.sponsorship | Singapore-MIT Alliance (SMA) | en |
| dc.format.extent | 101341 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | Computer Science (CS); | |
| dc.subject | reduction of a context-free grammar | en |
| dc.subject | one-letter context-free language | en |
| dc.subject | regular expression | en |
| dc.title | A New Constructive Method for the One-Letter Context-Free Grammars | en |
| dc.type | Article | en |
