Generation of sentences with their parses the case of propagating scattered context grammars /
Propagating scattered context grammars are used to generate their sentences together with their parses - that is, the sequences of labels denoting productions whose use lead to the generation of the corresponding sentences. It is proved that for every recursively enumerable language L, there exists...
Elmentve itt :
Szerzők: | |
---|---|
Dokumentumtípus: | Cikk |
Megjelent: |
2005
|
Sorozat: | Acta cybernetica
17 No. 1 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Tárgyszavak: | |
Online Access: | http://acta.bibl.u-szeged.hu/12750 |
LEADER | 01224nab a2200229 i 4500 | ||
---|---|---|---|
001 | acta12750 | ||
005 | 20220615123746.0 | ||
008 | 161015s2005 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 Meduna Alexander | |
245 | 1 | 0 | |a Generation of sentences with their parses |h [elektronikus dokumentum] : |b the case of propagating scattered context grammars / |c Meduna Alexander |
260 | |c 2005 | ||
300 | |a 11-20 | ||
490 | 0 | |a Acta cybernetica |v 17 No. 1 | |
520 | 3 | |a Propagating scattered context grammars are used to generate their sentences together with their parses - that is, the sequences of labels denoting productions whose use lead to the generation of the corresponding sentences. It is proved that for every recursively enumerable language L, there exists a propagating scattered context grammar whose language consists of L's sentences followed by their parses. | |
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 Techet Jiří |e aut |
856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12750/1/Meduna_2005_ActaCybernetica.pdf |z Dokumentum-elérés |