Weighted Regular Tree Grammars with Storage

Weighted Regular Tree Grammars with Storage

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...

Full description

Bibliographic Details
Main Authors: Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2018-07-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
computer science - formal languages and automata theory
f.1.1
f.4.1
f.4.3
Online Access:https://dmtcs.episciences.org/3664/pdf

Similar Items

Similar Items