Article3085: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Luisa Herrmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Zoltán |ErsterAutorNachname=Fülöp |FurtherAuthors=Luisa Herrmann; Heiko Vogler }} {{Article |Referiert=1 |Tit…“) |
Luisa Herrmann (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 2: | Zeile 2: | ||
|ErsterAutorVorname=Zoltán | |ErsterAutorVorname=Zoltán | ||
|ErsterAutorNachname=Fülöp | |ErsterAutorNachname=Fülöp | ||
|FurtherAuthors=Luisa Herrmann | |FurtherAuthors=Heiko Vogler; Luisa Herrmann | ||
}} | }} | ||
{{Article | {{Article | ||
| Zeile 16: | Zeile 16: | ||
|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 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. | |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 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. | ||
|DOI Name=https://doi.org/10.23638/DMTCS-20-1-26 | |DOI Name=https://doi.org/10.23638/DMTCS-20-1-26 | ||
|Projekt=QuantLA | |||
|Forschungsgruppe=Computational Logic | |Forschungsgruppe=Computational Logic | ||
}} | }} | ||
Version vom 11. April 2022, 14:38 Uhr
Weighted Regular Tree Grammars with Storage
Zoltán FülöpZoltán Fülöp, Heiko VoglerHeiko Vogler, Luisa HerrmannLuisa Herrmann
Zoltán Fülöp, Heiko Vogler, Luisa Herrmann
Weighted Regular Tree Grammars with Storage
Discrete Mathematics & Theoretical Computer Science, 20(1), 2018
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 LogicComputational Logic
@article{FVH2018,
author = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and Heiko Vogler and Luisa Herrmann},
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}
}
