1445 search results - page 28 / 289 » Uniformly Hard Languages |
LREC
2010
14 years 10 months ago
2010
Over the years, the field of Language Resources and Technology (LRT) has developed a tremendous amount of resources and tools. However, there is no ready-to-use map that researche...
100
click to vote
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. We further develop this,...
CSL
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
APLAS
2004
ACM
15 years 5 months ago
2004
ACM
Abstract. Fusion calculus is commonly regarded as a generalisation of pi. Actually, we prove that there is no uniform fully abstract embedding
AC
2003
Springer
15 years 5 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...