𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Branch-width, parse trees, and monadic second-order logic for matroids

✍ Scribed by Petr Hliněný

Book ID
108167396
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
349 KB
Volume
96
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring rules for finite trees, and pro
Coloring rules for finite trees, and probabilities of monadic second order sentences
✍ Alan R. Woods 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

A system of coloring rules is a set of rules for coloring the vertices of any finite rooted tree, starting at its leaves, which has the property that the color assigned to each vertex depends only on how many of its immediate predecessors there are of each color. The asymptotic behavior of the fract

A Comparison of Tree Transductions Defin
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
✍ Roderick Bloem; Joost Engelfriet 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Two well-known formalisms for the specification and computation of tree transductions are compared: the mso graph transducer and the attributed tree transducer with look-ahead, respectively. The mso graph transducer, restricted to trees, uses monadic second order logic to define the output tree in t