Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Algebraic Informatics (CAI 2015)

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

Included in the following conference series:

Abstract

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.

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

Access this chapter

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V.: Indexed grammars – an extension of context-free grammars. J. ACM 15, 647–671 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aho, A.V.: Nested stack automata. JACM 16, 383–406 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chomsky, N., Schützenberger, M.P.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, pp. 118–161. North-Holland, Amsterdam (1963)

    Google Scholar 

  4. Damm, W.: The IO- and OI-hierarchies. Theoret. Comput. Sci. 20, 95–207 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Damm, W., Goerdt, A.: An automata-theoretical characterization of the OI-hierarchy. Inform. Control 71, 1–32 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Denkinger, T.: A Chomsky-Schützenberger representation for weighted multiple context-free languages. In: The 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015) (2015). (accepted for publication)

    Google Scholar 

  7. 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 

  8. Droste, M., Meinecke, I.: Weighted automata and regular expressions over valuation monoids. Intern. J. of Found. of Comp. Science 22(8), 1829–1844 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  9. 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 

  10. Eilenberg, S.: Automata, Languages, and Machines - Volume A. Pure and Applied Mathematics, vol. 59. Academic Press (1974)

    Google Scholar 

  11. Engelfriet, J.: Iterated pushdown automata and complexity classes. In: Proc. of STOCS 1983, pp. 365–373. ACM, New York (1983)

    Google Scholar 

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

  13. Engelfriet, J., Schmidt, E.M.: IO and OI.I. J. Comput. System Sci. 15(3), 328–353 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  14. Engelfriet, J., Vogler, H.: Pushdown machines for the macro tree transducer. Theoret. Comput. Sci. 42(3), 251–368 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  15. Engelfriet, J., Vogler, H.: High level tree transducers and iterated pushdown tree transducers. Acta Inform. 26, 131–192 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  16. Fischer, M.J.: Grammars with macro-like productions. Ph.D. thesis, Harvard University, Massachusetts (1968)

    Google Scholar 

  17. Fratani, S., Voundy, E.M.: Dyck-based characterizations of indexed languages. published on arXiv http://arxiv.org/abs/1409.6112 (March 13, 2015)

  18. Ginsburg, S., Greibach, S.A.: Abstract families of languages. Memoirs of the American Math. Soc. 87, 1–32 (1969)

    MathSciNet  Google Scholar 

  19. Ginsburg, S., Greibach, S.A.: Principal AFL. J. Comput. Syst. Sci. 4, 308–338 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  20. Greibach, S.A.: Checking automata and one-way stack languages. J. Comput. System Sci. 3, 196–217 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  21. Greibach, S.A.: Full AFLs and nested iterated substitution. Inform. Control 16, 7–35 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  22. Harrison, M.A.: Introduction to Formal Language Theory, 1st edn. Addison-Wesley Longman Publishing Co., Inc, Boston (1978)

    MATH  Google Scholar 

  23. Hulden, M.: Parsing CFGs and PCFGs with a Chomsky-Schützenberger representation. In: Vetulani, Z. (ed.) LTC 2009. LNCS, vol. 6562, pp. 151–160. Springer, Heidelberg (2011)

    Google Scholar 

  24. Kambites, M.: Formal languages and groups as memory. arXiv:math/0601061v2 [math.GR] (October 19, 2007)

  25. Kanazawa, M.: Multidimensional trees and a Chomsky-Schützenberger-Weir representation theorem for simple context-free tree grammars. J. Logic Computation (2014)

    Google Scholar 

  26. Maslov, A.N.: The hierarchy of indexed languages of an arbitrary level. Soviet Math. Dokl. 15, 1170–1174 (1974)

    MATH  Google Scholar 

  27. Maslov, A.N.: Multilevel stack automata. Probl. Inform. Transm. 12, 38–42 (1976)

    Google Scholar 

  28. Okhotin, A.: Non-erasing variants of the Chomsky–Schützenberger theorem. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 121–129. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  29. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer-Verlag (1978)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  31. Wand, M.: An algebraic formulation of the Chomsky hierarchy. In: Manes, E.G. (ed.) Category Theory Applied to Computation and Control. LNCS, vol. 25, pp. 209–213. Springer, Heidelberg (1975)

    Chapter  Google Scholar 

  32. Weir, D.J.: Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania (1988)

    Google Scholar 

  33. Yoshinaka, R., Kaji, Y., Seki, H.: Chomsky-Schützenberger-type characterization of multiple context-free languages. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 596–607. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technische Universität Dresden, D-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 Heiko Vogler .

Editor information

Editors and Affiliations

  1. Institut für Maschinelle, Universität Stuttgart, Stuttgart, Baden-Württemberg, Germany

    Andreas Maletti

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Herrmann, L., Vogler, H. (2015). A Chomsky-Schützenberger Theorem for Weighted Automata with Storage. In: Maletti, A. (eds) Algebraic Informatics. CAI 2015. Lecture Notes in Computer Science(), vol 9270. Springer, Cham. https://doi.org/10.1007/978-3-319-23021-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23021-4_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23020-7

  • Online ISBN: 978-3-319-23021-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation