A Chomsky-Sch\"utzenberger representation for weighted multiple context-free languages
Formal Languages and Automata Theory
2016-11-29 v2
Abstract
We prove a Chomsky-Sch\"utzenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids.
Cite
@article{arxiv.1606.03982,
title = {A Chomsky-Sch\"utzenberger representation for weighted multiple context-free languages},
author = {Tobias Denkinger},
journal= {arXiv preprint arXiv:1606.03982},
year = {2016}
}
Comments
This is an extended and corrected version of a paper with the same title presented at the 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015)