Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2016: Developments in Language Theory pp 203–215Cite as

Weighted Symbolic Automata with Data Storage

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9840))

Abstract

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.

L. Herrmann—Supported by DFG Graduiertenkolleg 1763 (QuantLA).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. D’Antoni, L., Alur, R.: Symbolic Visibly Pushdown Automata. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 209–225. Springer, Heidelberg (2014)

    Google Scholar 

  2. Droste, M., Gastin, P.: Weighted Automata and Weighted Logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 513–525. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  4. Droste, M., Meinecke, I.: Describing Average- and Longtime-Behavior by Weighted MSO Logics. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 537–548. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Droste, M., Stüber, T., Vogler, H.: Weighted finite automata over strong bimonoids. Inf. Sci. 180(1), 156–166 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Droste, M., Vogler, H.: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 203–214. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Droste, M., Perevoshchikov, V.: A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 171–182. Springer, Heidelberg (2014)

    Google Scholar 

  8. Eilenberg, S.: Automata, Languages, and Machines. Pure and Applied Mathematics, vol. 59. Academic Press, New York (1974)

    Google Scholar 

  9. Engelfriet, J.: Context-free grammars with storage. Technical report 86–11, University of Leiden (1986), see also: arXiv:1408.0683 [cs.FL] (2014)

  10. Fülöp, Z., Stüber, T., Vogler, H.: A Büchi-like theorem for weighted tree automata over multioperator monoids. Theor. Comput. Syst. 50(2), 241–278 (2012)

    Article  MATH  Google Scholar 

  11. Herrmann, L., Vogler, H.: A Chomsky-Schützenberger theorem for weighted automata with storage. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 115–127. Springer, Switzerland (2015)

    Google Scholar 

  12. Kirsten, D.: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. Acta Cybern. 20(2), 211–221 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986)

    Google Scholar 

  14. Quaas, K.: MSO logics for weighted timed automata. Form. Methods Syst. Des. 38(3), 193–222 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  16. Scott, D.: Some definitional suggestions for automata theory. J. Comput. Syst. Sci. 1, 187–212 (1967)

    Article  MATH  Google Scholar 

  17. Veanes, M.: Applications of Symbolic Finite Automata. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 16–23. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  18. Veanes, M., Bjørner, N.: Symbolic tree automata. Inf. Process. Lett. 115(3), 418–424 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  19. Veanes, M., Bjørner, N., de Moura, L.: Symbolic Automata Constraint Solving. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 640–654. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Vogler, H., Droste, M., Herrmann, L.: A weighted MSO logic with storage behaviour and its Büchi-Elgot-Trakhtenbrot theorem. In: Dediu, A.H., Janoušek, J., Martín-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 127–139. Springer, Switzerland (2016)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Technische Universität Dresden, Nöthnitzer Str. 46, 01062, Dresden, Germany

    Luisa Herrmann & Heiko Vogler

Authors
  1. Luisa Herrmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heiko Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luisa Herrmann .

Editor information

Editors and Affiliations

  1. Université du Québec à Montréal , Montreal, Québec, Canada

    Srečko Brlek

  2. Dept Mathematiques, Univ du Quebec Montreal Dept Mathematiques, Montreal, Québec, Canada

    Christophe Reutenauer

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herrmann, L., Vogler, H. (2016). Weighted Symbolic Automata with Data Storage. In: Brlek, S., Reutenauer, C. (eds) Developments in Language Theory. DLT 2016. Lecture Notes in Computer Science(), vol 9840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53132-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-53132-7_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-53131-0

  • Online ISBN: 978-3-662-53132-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation