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

Vaszil, György (2007) Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components. Journal of Automata, Languages and Combinatorics, 12 (1-2). pp. 307-315.

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: Cellular Sensory and Optical Wave Computing 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/5390

Update Item Update Item