PC grammar systems with five context-free components generate all recursively enumerable languages
Csuhaj-Varjú, Erzsébet and Paun, GH and Vaszil, György (2003) PC grammar systems with five context-free components generate all recursively enumerable languages. THEORETICAL COMPUTER SCIENCE, 299. pp. 785-794.
Full text not available from this repository.| Item Type: | Article |
|---|---|
| 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:11 |
| Last Modified: | 11 Dec 2012 15:11 |
| URI: | https://eprints.sztaki.hu/id/eprint/3342 |
![]() |
Update Item |



