๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Monadic Second-Order Definable Text Languages

โœ Scribed by H. J. Hoogeboom; P. ten Pas

Publisher
Springer
Year
1997
Tongue
English
Weight
235 KB
Volume
30
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Circle graphs and monadic second-order l
Circle graphs and monadic second-order logic
โœ Bruno Courcelle ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 357 KB

This article is part of a project consisting in expressing, whenever possible, graph properties and graph transformations in monadic second-order logic or in its extensions using modulo p cardinality set predicates or auxiliary linear orders. A circle graph is the intersection graph of a set of chor

Monadic Second Order Logic And Its Fragm
Monadic Second Order Logic And Its Fragments
โœ Giacomo Lenzi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

Various recent results about monadic second order logic and its fragments are presented. These results have been obtained in the framework of the EU TMR Project GETGRATS.

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