8 search results - page 1 / 2 » Cut sets as recognizable tree languages |
FSS
2006
13 years 5 months ago
2006
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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We provide a complete description of the Wadge hierarchy for deterministically recognizable sets of infinite trees. In particular we give an elementary procedure to decid...
CSL
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
MFCS
1998
Springer
13 years 9 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...