Remarks on Propagating Partition-Limited ETOL Systems
| dc.creator | Fernau,Henning | |
| dc.date | 1996 | |
| dc.date.accessioned | 2024-02-06T12:48:32Z | |
| dc.date.available | 2024-02-06T12:48:32Z | |
| dc.description | In this paper, we sharpen the results of Gaeartner on the universality of partition-limited ET0L systems by showing that such deterministic systems characterize the recursively enumerable sets, and, furthermore, the propagating deterministic partition-limited ET0L systems characterize the programmed languages with appearance checking disallowing erasing productions. The main results of this paper have been announced in [10]. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-002-11-0745 | |
| dc.identifier | https://lib.jucs.org/article/27303/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7069 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 2(11): 745-755 | |
| dc.subject | Formal languages | |
| dc.subject | parallel rewriting systems | |
| dc.subject | k-limited systems | |
| dc.title | Remarks on Propagating Partition-Limited ETOL Systems | |
| dc.type | Research Article |