Quantitative Versions of the Chomsky-Schützenberger Theorem
Aus International Center for Computational Logic
Quantitative Versions of the Chomsky-Schützenberger Theorem
Vortrag von Pavlos Marantidis
- Veranstaltungsort: ABP 3105
- Beginn: 3. Dezember 2015 um 13:45
- Ende: 3. Dezember 2015 um 14:45
- Forschungsgruppe: Automatentheorie
- Event series: KBS Seminar
- iCal
The emergence of weighted structures in Formal Language Theory naturally gave rise to questions whether classical results hold in more general environments. The Chomsky-Schützenberger Theorem (1963) states that any context-free language (CFL) can be represented by two simpler languages, a regular and a Dyck language. Droste and Vogler (2013) derived such a theorem for the abstract structure of unital valuation monoids. In this talk, these constructions, in addition to a similar approach for stochastic CFLs will be presented.
