Reduction of simple semi-conditional grammars with respect to the number of conditional productions
The present paper discusses the descriptional complexity of simple semiconditional grammars with respect to the number of conditional productions. More specifically, it demonstrates that for every phrase-structure grammar, there exists an equivalent simple semi-conditional grammar that has no more t...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2002
|
| Sorozat: | Acta cybernetica
15 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12683 |
| LEADER | 01162nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12683 | ||
| 005 | 20220614144317.0 | ||
| 008 | 161015s2002 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 Reduction of simple semi-conditional grammars with respect to the number of conditional productions |h [elektronikus dokumentum] / |c Meduna Alexander |
| 260 | |c 2002 | ||
| 300 | |a 353-360 | ||
| 490 | 0 | |a Acta cybernetica |v 15 No. 3 | |
| 520 | 3 | |a The present paper discusses the descriptional complexity of simple semiconditional grammars with respect to the number of conditional productions. More specifically, it demonstrates that for every phrase-structure grammar, there exists an equivalent simple semi-conditional grammar that has no more than twelve conditional productions. | |
| 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 Švec Martin |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12683/1/cybernetica_015_numb_003_353-360.pdf |z Dokumentum-elérés |