Results 11 to 20 of about 25,771 (294)
Tree algebras and varieties of tree languages
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saeed Salehi
exaly +4 more sources
General varieties of tree languages
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Magnus Steinby
exaly +3 more sources
Tree algebra of sofic tree languages [PDF]
RAIRO - Theoretical Informatics and Applications, 2014 We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of sub-shifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages: the finite type tree languages and the tree languages which are almost of ...
Aubrun, Nathalie, Béal, Marie-Pierre
core +6 more sources
Positive varieties of tree languages
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tatjana Petković, Saeed Salehi
exaly +3 more sources
Piecewise testable tree languages [PDF]
Logical Methods in Computer Science, 2012 This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination
Mikołaj Bojańczyk +2 more
doaj +5 more sources
Qualitative Tree Languages [PDF]
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011 We study finite automata running over infinite binary trees and we relax the notion of accepting run by allowing a negligible set (in the sense of measure theory) of non-accepting branches. In this qualitative setting, a tree is accepted by the automaton if there exists a run over this tree in which almost every branch is accepting. This leads to a new
Carayol, Arnaud +2 more
openaire +4 more sources
Demonstratio Mathematica, 2013 Abstract A tree language of a fixed type τ is any set of terms of type τ. We consider here a binary operation + n on the set Wτ (Xn ) of all n-ary terms of type τ, which results in semigroup (Wτ (Xn ...
S L Wismath
exaly +3 more sources
Tree transducers and tree languages
Information and Control, 1978 Tree transducers (automata which read finite labeled trees and output finite labeled trees) are used to define a hierarchy of families of “tree languages” (sets of trees). In this hierarchy, families generated by “top-down” tree transducers (which read trees from the root toward the leaves) alternate with families generated by “bottom-up” tree ...
Baker, Brenda S.
openaire +2 more sources
Disentangling complex language contact and admixture in the broad Gansu-Qinghai region [PDF]
Fundamental ResearchLanguage evolution in the Gansu-Qinghai (GQ) region provides a key perspective for understanding cultural development along the eastern Silk Road. Previous genetic and archaeological studies have revealed complex, multi-ethnic interactions in this region,
Hongye Jin +7 more
doaj +2 more sources
State Complexity of Regular Tree Languages for Tree Matching [PDF]
International Journal of Foundations of Computer Science, 2016 We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees.
Sang-Ki Ko, Ha-Rim Lee, Yo-Sub Han
openaire +2 more sources