Sciweavers

FSS
2006
105views more  FSS 2006»
13 years 11 months ago
Cut sets as recognizable tree languages
A tree series over a semiring with partially ordered carrier set can be considered as a fuzzy set. We investigate conditions under which it can also be understood as a fuzzied rec...
Björn Borchardt, Andreas Maletti, Branimir Se...
DLT
2008
14 years 27 days ago
Construction of Tree Automata from Regular Expressions
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
Dietrich Kuske, Ingmar Meinecke