Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Chomsky-Schützenberger representation for weighted multiple context-free languages

Published 13 Jun 2016 in cs.FL | (1606.03982v2)

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

Citations (4)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Tobias Denkinger 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up