Shyamasundar, R. K. (1975) Necessary and sufficient conditions for a power language to be deterministic International Journal of Computer Mathematics, 5 (1-4). pp. 133-142. ISSN 0020-7160
Full text not available from this repository.
Official URL: http://www.tandfonline.com/doi/abs/10.1080/0020716...
Related URL: http://dx.doi.org/10.1080/00207167508803107
Abstract
Necessary and sufficient conditions for a power language to be an LR language [LR(k) for some k] are given in terms of the words of the power language. Further, the conditions for a power language to be an LR-regular language are obtained.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Taylor and Francis Group. |
| Keywords: | Deterministic Languages; LR(k) Grammars; LR-regular Grammars; Power Languages; Regular Partitions |
| ID Code: | 56605 |
| Deposited On: | 24 Aug 2011 10:55 |
| Last Modified: | 24 Aug 2011 10:55 |
Repository Staff Only: item control page
