![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Finkel A. Tellier I.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.164, Iss.1, 1996-09, pp. : 207-221
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)
Power properties of NLC graph grammars with a polynomial membership problem
By Flasinski M.
Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The Ideal Membership Problem in Non-Commutative Polynomial Rings
Journal of Symbolic Computation, Vol. 22, Iss. 1, 1996-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Programmed grammars and their relation to the LBA problem
By Bordihn Henning Holzer Markus
Acta Informatica, Vol. 43, Iss. 4, 2006-11 ,pp. :