Skip to main content
Conference Proceedings

Rational weighted tree languages with storage and the kleene-goldstine theorem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11545 LNCS 138-150
DOI: 10.1007/978-3-030-21363-3_12
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce rational weighted tree languages with storage over commutative, complete semirings and show a Kleene-Goldstine theorem.

Cite

CITATION STYLE

APA

Fülöp, Z., & Vogler, H. (2019). Rational weighted tree languages with storage and the kleene-goldstine theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11545 LNCS, pp. 138–150). Springer Verlag. https://doi.org/10.1007/978-3-030-21363-3_12

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