Skip to main content
Conference Proceedings

A Chomsky-Schützenberger theorem for weighted automata with storage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9270 115-127
DOI: 10.1007/978-3-319-23021-4_11
11Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We enrich the concept of automata with storage by weights taken from any unital valuation monoid. We prove a Chomsky- Schüutzenberger theorem for the class of weighted languages recognizable by such weighted automata with storage.

Cite

CITATION STYLE

APA

Herrmann, L., & Vogler, H. (2015). A Chomsky-Schützenberger theorem for weighted automata with storage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9270, pp. 115–127). Springer Verlag. https://doi.org/10.1007/978-3-319-23021-4_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free