Weighted Regular Tree Grammars with Storage

Abstract

We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each weighted regular tree grammar with storage generates a weighted tree language, which is a mapping from the set of trees to the multioperator monoid. We prove that, for multioperator… (More)

Topics

4 Figures and Tables

Slides referencing similar topics