Weighted Regular Tree Grammars with Storage

From International Center for Computational Logic

Toggle side column

Weighted Regular Tree Grammars with Storage

Zoltán FülöpZoltán Fülöp,  Luisa HerrmannLuisa Herrmann,  Heiko VoglerHeiko Vogler
Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
Weighted Regular Tree Grammars with Storage
Discrete Mathematics & Theoretical Computer Science, 20(1), 2018
  • KurzfassungAbstract
    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 monoids canonically associated to particular strong bi-monoids, the support of the generated weighted tree languages can be generated by (unweighted) regular tree grammars with storage. We characterize the class of all generated weighted tree languages by the composition of three basic concepts. Moreover, we prove results on the elimination of chain rules and of finite storage types, and we characterize weighted regular tree grammars with storage by a new weighted MSO-logic.
  • Projekt:Project: QuantLA
  • Forschungsgruppe:Research Group: Computational Logic
@article{FHV2018,
  author  = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and Luisa Herrmann and Heiko Vogler},
  title   = {Weighted Regular Tree Grammars with Storage},
  journal = {Discrete Mathematics \& Theoretical Computer Science},
  volume  = {20},
  number  = {1},
  year    = {2018},
  doi     = {https://doi.org/10.23638/DMTCS-20-1-26}
}