A Chomsky-Sch\"utzenberger representation for weighted multiple context-free languages
Tobias Denkinger
TL;DR
This paper extends the Chomsky-Sch"utzenberger representation theorem to weighted multiple context-free languages over complete commutative strong bimonoids, providing a new theoretical framework for analyzing such languages.
Contribution
It introduces a novel representation theorem for weighted multiple context-free languages, broadening the understanding of their structure in formal language theory.
Findings
Established a Chomsky-Sch"utzenberger type theorem for weighted multiple context-free languages
Extended classical results to weighted settings over complete commutative strong bimonoids
Provides a foundation for future analysis of weighted language classes
Abstract
We prove a Chomsky-Sch\"utzenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · DNA and Biological Computing