首页 | 本学科首页   官方微博 | 高级检索  
     


A Kleene Theorem for Weighted Tree Automata
Authors:Manfred Droste  Christian Pech  Heiko Vogler
Affiliation:(1) Department of Mathematics and Computer Science, University of Leipzig, D-04109 Leipzig, Germany;(2) Department of Mathematics and Natural Sciences, Dresden University of Technology, D-01062 Dresden, Germany;(3) Department of Computer Science, Dresden University of Technology, D-01062 Dresden, Germany
Abstract:In this paper we prove Kleenersquos result for formal tree series over a commutative semiring A (which is not necessarily complete or continuous or idempotent), i.e., the class of formal tree series over A which are accepted by weighted tree automata, and the class of rational tree series over A are equal. We show the result by direct automata-theoretic constructions and prove their correctness.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号