Results 261 to 270 of about 25,771 (294)
Some of the next articles are maybe not open access.
Pattern Recognition, 1991
Abstract Conventionally, tree languages have been studied under the restriction that a symbol may appear in a tree only with a fixed number of descendants (the rank of the symbol). This limitation runs contrary to the proposed uses of tree languages in syntactic pattern recognition and in mathematical linguistics.
exaly +2 more sources
Abstract Conventionally, tree languages have been studied under the restriction that a symbol may appear in a tree only with a fixed number of descendants (the rank of the symbol). This limitation runs contrary to the proposed uses of tree languages in syntactic pattern recognition and in mathematical linguistics.
exaly +2 more sources
Inference of Reversible Tree Languages
IEEE Transactions on Systems, Man, and Cybernetics, 2004In this paper, we study the notion of k-reversibility and k-testability when regular tree languages are involved. We present an inference algorithm for learning a k-testable tree language that runs in polynomial time with respect to the size of the sample used.
Damian Lopez, JOSÉ M Sempere
exaly +3 more sources
Theory in Biosciences, 2010
Darwin 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 +3 more sources
Darwin 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 +3 more sources
Tree languages and branched groups
Mathematische Zeitschrift, 2023 We study the portraits of isometries of rooted trees—the labelling of the tree, at each vertex, by the permutation of its descendants—in terms of languages. We characterize regularly branched self-similar groups in terms of $\omega $ ω -regular languages.
Laurent Bartholdi +2 more
exaly +2 more sources
Tree Adjoining Languages and Multipushdown Languages
Theory of Computing Systems, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CHERUBINI, ALESSANDRA +1 more
openaire +2 more sources
Asian-European Journal of Mathematics, 2008
Sets of terms of type τ are called tree languages (see [6]). There are several possibilities to define superposition operations on sets of tree languages. On the basis of such superposition operations we define binary associative operations on tree languages and investigate the properties of the arising semigroups.
Denecke, K., Sarasit, N.
openaire +2 more sources
Sets of terms of type τ are called tree languages (see [6]). There are several possibilities to define superposition operations on sets of tree languages. On the basis of such superposition operations we define binary associative operations on tree languages and investigate the properties of the arising semigroups.
Denecke, K., Sarasit, N.
openaire +2 more sources
Categorial Grammars and Tree Languages
Journal of Logic and Computation, 2004Summary: We consider a representation of the structure of derivations in Ajdukiewicz and Lambek categorial grammars called derived trees. We define derived tree languages of those grammars based on syntactic calculi formalized in Gentzen style and in natural deduction format and examine their relation to the families of local and regular tree languages.
openaire +2 more sources
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
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