Titlebook: Mathematical Foundations of Computer Science 2007; 32nd International S Luděk Kučera,Antonín Kučera Conference proceedings 2007 Springer-Ve

骚动

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626141.jpg

Regurgitation

anchor

Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemeses. Subsuming well-known classes of models of computation, these rich hierarchies (of word languages, trees, and graphs respectively) have excellent model-checking properties. In this extended abstract, we survey recent expressivity and decidability results about these infinite structures.

易弯曲

978-3-540-74455-9Springer-Verlag Berlin Heidelberg 2007

欢腾

暗指

0302-9743 Overview: 978-3-540-74455-9978-3-540-74456-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

Panacea

palliate

rods366

进步

NP by Means of Lifts and Shadowss of coloring problems when restricted to most frequent graph classes. Using results of Nešetřil and Ossona de Mendez for bounded expansion classes (which include bounded degree and proper minor closed classes) we prove that the restriction of every class defined as the shadow of finitely many color