![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Dumitrescu S.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.165, Iss.2, 1996-10, pp. : 463-474
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On simulating non-returning PC grammar systems with returning systems
By Vaszil G.
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the computational power of context-free PC grammar systems
By Mandache N.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Some results about centralized PC grammar systems
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Decidability problems in grammar systems
By Mihalache V.
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :