Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components

Vaszil, György (2005) Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components. In: Seventh international workshop on descriptional complexity of formal systems. Proceedings. Como, 2005..

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: Cellular Sensory and Optical Wave Computing Laboratory
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:18
Last Modified: 11 Dec 2012 15:18
URI: http://eprints.sztaki.hu/id/eprint/4068

Update Item Update Item