Author： Burmeister P. Monserrat M. Rossello F. Valiente G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.216, Iss.1, 1999-03, pp. : 311-362
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
Access to resources
Recommend
By Herchl Ján Jakubíková-Studenovská Danica
Soft Computing, Vol. 11, Iss. 11, 2007-09 ,pp. :
Locating the contractum in the double pushout approach
By Banach R.
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :
Automaticity II: Descriptional complexity in the unary case
By Pomerance C. Robson J.M. Shallit J.
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
An algebraic generalization of Frege structures - binding algebras
By Sun Y.
Theoretical Computer Science, Vol. 211, Iss. 1, 1999-01 ,pp. :