On the size complexity of non-returning context-free PC grammar systems
Csuhaj Varjú, Erzsébet and Vaszil, György (2009) On the size complexity of non-returning context-free PC grammar systems. In: DCFS 2009. 11th international workshop on descriptional complexity of formal systems. Magdeburg, 2009..
Full text not available from this repository.| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Computational Optical Sensing and Processing Laboratory |
| Depositing User: | Eszter Nagy |
| Date Deposited: | 11 Dec 2012 15:31 |
| Last Modified: | 11 Dec 2012 15:31 |
| URI: | https://eprints.sztaki.hu/id/eprint/5501 |
![]() |
Update Item |



