Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

Recognizable tree series with discounting

Abstract

We consider weighted tree automata with discounting over commutative semirings. For their behaviors we establish a Kleene theorem and an MSO-logic characterization. We introduce also weighted Muller tree automata with discounting over the max-plus and the min-plus semirings, and we show their expressive equivalence with two fragments of weighted MSO-sentences

Similar works

This paper was published in University of Szeged.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.