Parallel communicating grammar systems with bounded resources

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.276, Iss.1, 2002-04, pp. : 205-219

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

On the computational completeness of context-free parallel communicating grammar systems

By Csuhaj-Varju E. Vaszil G.

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 349-358

Elsevier

Access to resources Recommend Favorite

Series-parallel languages and the bounded-width property

By Lodaya K. Weil P.

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 347-380

Elsevier

Access to resources Recommend Favorite

Decidability problems in grammar systems

By Mihalache V.

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 169-189

Elsevier

Access to resources Recommend Favorite

Systems of linear difference equations with bounded and robustly bounded solutions

By Ito Naoharu

Artificial Life and Robotics, Vol. 17, Iss. 1, 2012-10 ,pp. : 140-144

Springer Publishing Company

Access to resources Recommend Favorite

A process algebra of communicating shared resources with dense time and priorities

By Bremond-Gregoire P. Lee I.

Theoretical Computer Science, Vol. 189, Iss. 1, 1997-12 ,pp. : 179-219

Elsevier

Access to resources Recommend Favorite