Results 231 to 240 of about 19,622 (256)
Some of the next articles are maybe not open access.
Fuzzy tree language recognizability
Fuzzy Sets and Systems, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symeon Bozapalidis +1 more
openaire +1 more source
Bull. EATCS, 1988
A tree language L is definite if membership in L depends only on the subtree of height k (starting at the root). This concept was developed in analogy to similar concept in string languages [\textit{M. Perles}, \textit{M. O. Rabin}, \textit{E. Shamir}. The theory of definite automata, IEEE Trans. Elect. Comput. EC-12, 233-243 (1963; Zbl 0158.010)]. The
openaire +1 more source
A tree language L is definite if membership in L depends only on the subtree of height k (starting at the root). This concept was developed in analogy to similar concept in string languages [\textit{M. Perles}, \textit{M. O. Rabin}, \textit{E. Shamir}. The theory of definite automata, IEEE Trans. Elect. Comput. EC-12, 233-243 (1963; Zbl 0158.010)]. The
openaire +1 more source
Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages
2011Minimalist grammars are a mildly context-sensitive grammar framework within which analyses in mainstream chomskyian syntax can be faithfully represented. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under intersection with regular tree languages.
openaire +1 more source
Systolic Tree Omega-Languages.
1995The class of -languages recognized by systolic tree automata is introduced. That class extends the class of Büchi -languages and is closed under boolean operations. The emptiness problem for systolic tree automata on infinite sequences is decidable.
A. Monti, PERON, ADRIANO
openaire +3 more sources
Generalized definite tree languages
1989A word language L is called generalized definite iff the membership of a word w in L depends only on the suffix and the prefix of w of fixed length. In an analogous way we introduce generalized definite tree languages where (viewing trees bottom-up) the prefix of length k is replaced by the set of "frontier-trees" of height less or equal than k and the
openaire +1 more source
Language trees not equal gene trees.
Theory in biosciences = Theorie in den Biowissenschaften, 2011Darwin saw similarities between the evolution of species and the evolution of languages, and it is now widely accepted that similarities between related languages can often be interpreted in terms of a bifurcating descent history ('phylogenesis'). Such interpretations are supported when the distributions of shared and unshared traits (for example, in ...
James, Steele, Anne, Kandler
openaire +1 more source
Principal abstract families of weighted tree languages
Information and Computation, 2022Heiko Vogler
exaly
Semigroups of Terms, Tree Languages, Menger Algebra of n-Ary Functions and Their Embedding Theorems
Symmetry, 2021Sorasak Leeratanavalee +1 more
exaly

