Author： Makowsky J.A. Marino J.P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.303, Iss.1, 2003-06, pp. : 157-170
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
Monadic second-order logic on tree-like structures
Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. :
Access to resources
Recommend
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
By Matz O.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
The component hierarchy of chain-free cooperating distributed regular tree grammars
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
Treewidth Lower Bounds with Brambles
By Bodlaender Hans Grigoriev Alexander Koster Arie
Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. :