Author： Birget J.-C. Margolis S. Meakin J. Weil P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.242, Iss.1, 2000-07, pp. : 247-281
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
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
By Slany W.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Access to resources
Recommend
A PSPACE-complete fragment of second-order linear logic
By Perrier G.
Theoretical Computer Science, Vol. 224, Iss. 1, 1999-08 ,pp. :
Image reducing words and subgroups of free groups
By Ananichev D.S. Cherubini A. Volkov M.V.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
Intractability of decision problems for finite-memory automata
Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. :