Meduna Alexander: Descriptional complexity of multi-continuous grammars. In: Acta cybernetica, (13) 4. pp. 375-384. (1998)
Preview |
Cikk, tanulmány, mű
cybernetica_013_numb_004_375-384.pdf Download (542kB) | Preview |
Abstract
The present paper discusses multi-continuous grammars and their descriptional complexity with respect to the number of nonterminals. It proves that six-nonterminal multi-continuous grammars characterize the family of recursively enumerable languages. In addition, this paper formulates an open problem area closely related to this characterization.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1998 |
| Volume: | 13 |
| Number: | 4 |
| ISSN: | 0324-721X |
| Page Range: | pp. 375-384 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38506/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 383-384. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 13. 15:47 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12597 |
Actions (login required)
 |
View Item |
