✦ LIBER ✦

A regular characterization of graph languages definable in monadic second-order logic

✍ Scribed by Joost Engelfriet

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 867 KB
Volume: 88
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90078-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of ω-regular languages

Characterization of ω-regular languages by monadic second-order formulas

✍ Hideki Yamasaki; Masako Takahashi; Kojiro Kobayashi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 530 KB

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