Journal ArticleDOI
Weighted grammars and Kleene's theorem
Reads0
Chats0
TLDR
Using regular tree grammars weighted over a semiring, Kleene's theorem is established in the context of formal tree power series.About:
This article is published in Information Processing Letters.The article was published on 1987-01-15. It has received 63 citations till now. The article focuses on the topics: Kleene star & Kleene algebra.read more
Citations
More filters
Book ChapterDOI
Weighted Tree Automata and Tree Transducers
Zoltán Fülöp,Heiko Vogler +1 more
TL;DR: The equivalence between recognizable tree series and equational, rational, and MSO-definable tree series is discussed, and a comparison of several other models of recognizability is presented.
Journal ArticleDOI
Compositions of extended top-down tree transducers
TL;DR: It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class, and it is demonstrated that every linear epsilon-free extended top-down tree transducers with regular look-ahead can be implemented by a linear multi bottom-up tree transducer.
Journal ArticleDOI
Weighted Logics for Unranked Tree Automata
Manfred Droste,Heiko Vogler +1 more
TL;DR: It is shown 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 the authors deal only with ranked trees, but, surprisingly, not in general.
Journal Article
A pumping lemma and decidability problems for recognizable tree series
TL;DR: The pumping lemma is applied and it is shown that for every non-deterministic bu-w-fta over a locally finite semiring there exists an equivalent deterministic one.
Proceedings Article
Efficient Inference through Cascades of Weighted Tree Transducers
TL;DR: A detailed description of algorithms for application of cascades of weighted tree transducers to weighted tree acceptors is given, connecting formal theory with actual practice.
References
More filters
Book
Tree automata
TL;DR: A context-free grammar over the terminal alphabet generating the Dyck language of well-bracketed strings and a product construction for nondeterministic bu-ta A 1 and A 2, to discuss whether there are simpler means of specifying them formally.
Journal ArticleDOI
Recognizable formal power series on trees
TL;DR: A theory of formal power series on trees is proposed, some of their basic properties are presented, and various examples of applications are presented which, it is hoped, will show the interest of its development within the framework sketched.