Weighted Logics for Unranked Tree Automata

10 years 1 months ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two concepts. We show that weighted tree automata and a syntactically restricted weighted MSO-logic have the same expressive power in case the semiring is commutative or in case we deal only with ranked trees, but, surprisingly, not in general. This demonstrates a crucial difference between the theories of ranked trees and unranked trees in the weighted case.
Manfred Droste, Heiko Vogler
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where MST
Authors Manfred Droste, Heiko Vogler
Comments (0)