Weighted Symbolic Automata with Data Storage

Luisa HerrmannLuisa Herrmann, Heiko VoglerHeiko Vogler

DOI Link

Luisa Herrmann, Heiko Vogler
Weighted Symbolic Automata with Data Storage
In Srečko Brlek, Christophe Reutenauer, eds., Developments in Language Theory, volume 9840 of Lecture Notes in Computer Science, 203-215, 2016. Springer

Details
Bibtex

KurzfassungAbstract
We introduce weighted symbolic automata with data storage, which combine and generalize the concepts of automata with storage types, weighted automata, and symbolic automata. By defining two particular data storages, we show that this combination is rich enough to capture symbolic visibly pushdown automata and weighted timed automata. We introduce a weighted MSO-logic and prove a Büchi-Elgot-Trakhtenbrot theorem, i.e., the new logic and the new automaton model are expressively equivalent.
Projekt:Project: QuantLA
Forschungsgruppe:Research Group: Computational LogicComputational Logic

The final publication is available at Springer via http://dx.doi.org/https://doi.org/10.1007/978-3-662-53132-7_17.

@inproceedings{HV2016,
  author    = {Luisa Herrmann and Heiko Vogler},
  title     = {Weighted Symbolic Automata with Data Storage},
  editor    = {Sre{\v{c}}ko Brlek and Christophe Reutenauer},
  booktitle = {Developments in Language Theory},
  series    = {Lecture Notes in Computer Science},
  volume    = {9840},
  publisher = {Springer},
  year      = {2016},
  pages     = {203-215},
  doi       = {https://doi.org/10.1007/978-3-662-53132-7_17}
}