Back to results

Technische Universität Dresden

Kleene-Type Results for Weighted Tree-Automata

Abstract

dc:description.abstract

The main result of this thesis is the generalization of the Kleene-theorem to formal tree-series over commutative semirings (the Kleene theorem states the coincidence between rational and recognizable formal languages). To this end weighted tree-languages are introduced and the Kleene-theorem is proved for them. The desired result for formal tree-series is then obtained through application of a homomorphism that relates weighted tree-languages with formal tree-series. In the second part of the thesis the connections to the theorie of Iteration-theories are discovered. In particular it is shown there that the grove-theory of formal tree-series forms a partial iteration-theory.

Degree

thesis:*
Level thesis:degree_level
thesis.doctoral
Grantor dc:publisher
Technische Universität Dresden
Year
2003

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Pech, Christian
Contributors dc:contributor
  • Pöschel, Reinhard
  • Droste, Manfred
  • Esik, Zoltan

Subjects

dc:subject × 24

Chain of custody

source
Harvested from
QUCOSA
Base URL
www.qucosa.de/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Pech, Christian. Kleene-Type Results for Weighted Tree-Automata. thesis.doctoral thesis, Technische Universität Dresden, 2003.