The Chomsky-Schutzenberger Theorem for Quantitative Context-Free Languages by Heiko Vogler, University of Dresden
ABSTRACT: Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure of a semiring, but recently also other weight computations like average have been considered. Here, we investigate quantitative context-free languages over very general weight structures incorporating all semirings, average computations, … The Chomsky-Schutzenberger Theorem for Quantitative Context-Free Languages by Heiko Vogler, University of Dresden