A polynomial algorithm for the membership problem with categorial grammars

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.

Previous Menu Next

Abstract

Related content

Power properties of NLC graph grammars with a polynomial membership problem

By Flasinski M.  

Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. : 189-231

Elsevier

Access to resources Recommend Favorite

The Ideal Membership Problem in Non-Commutative Polynomial Rings

By Pritchard F.L.E.O.N.  

Journal of Symbolic Computation, Vol. 22, Iss. 1, 1996-01 ,pp. : 27-48

Academic Press

Access to resources Recommend Favorite

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

By Brucker Peter  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 371-389

Springer Publishing Company

Access to resources Recommend Favorite

Programmed grammars and their relation to the LBA problem

By Bordihn Henning   Holzer Markus  

Acta Informatica, Vol. 43, Iss. 4, 2006-11 ,pp. : 223-242

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems

By DasGupta  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 161-189

Elsevier

Access to resources Recommend Favorite