Sciweavers

122 search results - page 1 / 25
» Definability in the Infix Order on Words
Sort
View
DLT
2009
13 years 2 months ago
Definability in the Infix Order on Words
Oleg V. Kudinov, Victor L. Selivanov
TCS
2010
12 years 11 months ago
Definable transductions and weighted logics for texts
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
Christian Mathissen
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 4 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin
CORR
1998
Springer
142views Education» more  CORR 1998»
13 years 4 months ago
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the...
Norbert Bröker
CAI
2009
Springer
13 years 2 months ago
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
This paper studies conditions under which the operation of parallel insertion can be reversed by parallel deletion, i.e., when does the equality (L1 L2) L2 = L1 hold for language...
Bo Cui, Lila Kari, Shinnosuke Seki