Results 31 to 40 of about 2,050,088 (230)
Restrictions on tree adjoining languages [PDF]
7 pages LaTeX + 5 eps ...
SATTA, GIORGIO, SCHULER W.
openaire +5 more sources
Regular tree languages in low levels of the Wadge Hierarchy [PDF]
In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the ...
Mikołaj Bojańczyk +3 more
doaj +1 more source
Analyzing Indo-European Language Similarities Using Document Vectors
The evaluation of similarities between natural languages often relies on prior knowledge of the languages being studied. We describe three methods for building phylogenetic trees and clustering languages without the use of language-specific information ...
Samuel R. Schrader, Eren Gultepe
doaj +1 more source
Finite Automata with Generalized Acceptance Criteria [PDF]
We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i.e., a condition on the sequence of leaves in the automaton's computation tree.
Timo Peichl, Heribert Vollmer
doaj +3 more sources
Languages of Nested Trees [PDF]
We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown programs, so that the problem of branching-time software model checking may be phrased as a membership question for such languages.
Alur, Rajeev +2 more
openaire +2 more sources
Transformations Between Different Types of Unranked Bottom-Up Tree Automata [PDF]
We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string ...
Xiaoxue Piao, Kai Salomaa
doaj +1 more source
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 ...
Denecke, K., Sarasit, N., Wismath, S. L.
openaire +2 more sources
A polynomial-time parsing algorithm for TT-MCTAG [PDF]
This paper investigates the class of Tree-Tuple MCTAG with Shared Nodes, TT-MCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language processing, in particular for dealing with discontinuities and word order ...
KALLMEYER L +4 more
core +1 more source
Valuing All Languages in Europe [PDF]
The VALEUR project (2004-2007) took as its focus the 'additional' languages of Europe. These are defined as all languages in use in contexts where they are not 'national', 'official', or 'dominant' languages.
McPake, Joanna +7 more
core +4 more sources
Syntactic Learning over Tree Tiers
The class of tier-based strictly 2-local (TSL2) languages has been shown to be useful in modeling patterns across different linguistic domains. This paper discusses the learnability of the intersection closure of the TSL2 languages, multi-TSL2 (MTSL2). I
Logan Swanson
doaj +1 more source

