Author： Michel Pascal
Publisher： Springer Publishing Company
ISSN： 0933-5846
Source： Archive for Mathematical Logic, Vol.46, Iss.2, 2007-02, pp. : 123-148
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
The Computational Complexity of One-Dimensional Sandpiles
Theory of Computing Systems, Vol. 41, Iss. 1, 2007-07 ,pp. :
Access to resources
Recommend
One-Nonterminal Conjunctive Grammars over a Unary Alphabet
By Jeż Artur
Theory of Computing Systems, Vol. 49, Iss. 2, 2011-08 ,pp. :
The Journal of Symbolic Logic, Vol. 18, Iss. 4, 1953-12 ,pp. :
The Computational Complexity of Weak Saddles
By Brandt Felix
Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. :