On regular characterizations of languages by grammar systems
We show that grammar systems with communication by command and with extremely simple rewriting rules are able to generate all recursively enumerable languages. The result settles several open problems in the area of grammar systems.
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1996
|
| Sorozat: | Acta cybernetica
12 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12571 |
| LEADER | 01010nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12571 | ||
| 005 | 20220613142951.0 | ||
| 008 | 161015s1996 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Ilie Lucian | |
| 245 | 1 | 3 | |a On regular characterizations of languages by grammar systems |h [elektronikus dokumentum] / |c Ilie Lucian |
| 260 | |c 1996 | ||
| 300 | |a 411-425 | ||
| 490 | 0 | |a Acta cybernetica |v 12 No. 4 | |
| 520 | 3 | |a We show that grammar systems with communication by command and with extremely simple rewriting rules are able to generate all recursively enumerable languages. The result settles several open problems in the area of grammar systems. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Salomaa Arto |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12571/1/cybernetica_012_numb_004_411-425.pdf |z Dokumentum-elérés |