Author： Bordihn Henning Holzer Markus
Publisher： Springer Publishing Company
ISSN： 0001-5903
Source： Acta Informatica, Vol.43, Iss.4, 2006-11, pp. : 223-242
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Nonterminal complexity of programmed grammars
By Fernau H.
Theoretical Computer Science, Vol. 296, Iss. 2, 2003-03 ,pp. :
Access to resources
Recommend
A polynomial algorithm for the membership problem with categorial grammars
Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. :
Power properties of NLC graph grammars with a polynomial membership problem
By Flasinski M.
Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. :
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
By Cai J.-Y.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :