A Chomsky-Sch\"utzenberger representation for weighted multiple context-free languages

WS 2015  ·  Denkinger Tobias ·

We prove a Chomsky-Sch\"utzenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids.

PDF Abstract WS 2015 PDF WS 2015 Abstract

Code
Add Remove Mark official

No code implementations yet. Submit your code now

Categories

Formal Languages and Automata Theory

Datasets

  Add Datasets introduced or used in this paper
Contact us on: hello@paperswithcode.com . Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Data policy Cookies policy