A Chomsky-Schützenberger Theorem for Weighted Automata with Storage

From International Center for Computational Logic

Toggle side column

A Chomsky-Schützenberger Theorem for Weighted Automata with Storage

Luisa HerrmannLuisa Herrmann,  Heiko VoglerHeiko Vogler
Luisa Herrmann, Heiko Vogler
A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
In Andreas Maletti, eds., Algebraic Informatics, volume 9270 of Lecture Notes in Computer Science, 115-127, 2015. Springer
  • KurzfassungAbstract
    We enrich the concept of automata with storage by weights taken from any unital valuation monoid. We prove a Chomsky-Schützenberger theorem for the class of weighted languages recognizable by such weighted automata with storage.
  • Forschungsgruppe:Research Group: Computational Logic
The final publication is available at Springer via http://dx.doi.org/https://doi.org/10.1007/978-3-319-23021-4_11.
@inproceedings{HV2015,
  author    = {Luisa Herrmann and Heiko Vogler},
  title     = {A Chomsky-Sch{\"{u}}tzenberger Theorem for Weighted Automata with
               Storage},
  editor    = {Andreas Maletti},
  booktitle = {Algebraic Informatics},
  series    = {Lecture Notes in Computer Science},
  volume    = {9270},
  publisher = {Springer},
  year      = {2015},
  pages     = {115-127},
  doi       = {https://doi.org/10.1007/978-3-319-23021-4_11}
}