Sciweavers

1423 search results - page 51 / 285
» Languages of Nested Trees
Sort
View
ENTCS
2006
141views more  ENTCS 2006»
14 years 12 months ago
Abstract Families of Abstract Categorial Languages
Families of Categorial Languages Makoto Kanazawa 1 National Institute of Informatics Tokyo, Japan We show that the class of string languages generated by abstract categorial gramm...
Makoto Kanazawa
LICS
1995
IEEE
15 years 3 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning
IPL
2006
93views more  IPL 2006»
14 years 11 months ago
A decidable characterization of the classes between lintime and exptime
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
Salvatore Caporaso
ACTAC
1998
71views more  ACTAC 1998»
14 years 11 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
15 years 9 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...