𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterizations of transductions defined by abstract families of transducers

✍ Scribed by Oscar H. Ibarra

Publisher
Springer
Year
1971
Tongue
English
Weight
773 KB
Volume
5
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On Certain Closure Operators Defined by
On Certain Closure Operators Defined by Families of Semiring Morphisms
✍ Georg Karner; Werner Kuich πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 153 KB

Given a continuous semiring A and a collection α‘’ of semiring morphisms mapping the elements of A into finite matrices with entries in A we define α‘’-closed semirings. These are fully rationally closed semirings that are closed under the following operation: each morphism in α‘’ maps an element of the α‘’